X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=notes_and_schedule.mdwn;h=4655c55f81b83507dabd831c8f70c0b9ed2d196d;hp=50a9c33bb1c7b883e9809413e16a5646a0f6bd28;hb=44843f96be29b33e45ee026b2a6b87c4a65876b9;hpb=8f9f0e341d33c538d35919beada890f28aa5aa7c
diff --git a/notes_and_schedule.mdwn b/notes_and_schedule.mdwn
index 50a9c33b..4655c55f 100644
--- a/notes_and_schedule.mdwn
+++ b/notes_and_schedule.mdwn
@@ -1,26 +1,19 @@
-This is very sketchy at this point, but it should give a sense of our intended scope.
+# Lecture Notes #
+
+[[Week1]] (13 Sept) Applications; Basics of Lambda Calculus; Comparing Different Languages
+
-## 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
-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.