-This is very sketchy at this point, but it should give a sense of our intended scope.
+# Lecture Notes #
+
+[[Week1]] (13 Sept)
-## Introduction ##
+# Still To Come #
-1. Declarative vs imperatival models of computation.
-2. Variety of ways in which "order can matter."
-3. Variety of meanings for "dynamic."
-4. Schoenfinkel, Curry, Church: a brief history
-5. Functions as "first-class values"
-6. "Curried" functions
+This is very sketchy at this point, but it should give a sense of our intended scope.
-## The "pure" or untyped lambda calculus ##
+## More on the "pure" or untyped lambda calculus ##
-1. Beta reduction
-1. Substitution; using alpha-conversion and other strategies
-1. Conversion versus reduction
1. Eta reduction and "extensionality"
1. Different evaluation strategies (call by name, call by value, etc.)
1. Strongly normalizing vs weakly normalizing vs non-normalizing; Church-Rosser Theorem(s)
1. Lambda calculus compared to combinatorial logic<p>
-1. Encoding pairs (and triples and ...)
-1. Encoding booleans
1. Church-like encodings of numbers, defining addition and multiplication
1. Defining the predecessor function; alternate encodings for the numbers
1. Homogeneous sequences or "lists"; how they differ from pairs, triples, etc.