X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=notes_and_schedule.mdwn;h=628a960d7da0d496d228f5025ccb17892ce29952;hp=50a9c33bb1c7b883e9809413e16a5646a0f6bd28;hb=dc4a37d3f21dae7e6aceb29c6291fc2e7daa2f5e;hpb=8f9f0e341d33c538d35919beada890f28aa5aa7c

diff --git a/notes_and_schedule.mdwn b/notes_and_schedule.mdwn
index 50a9c33b..628a960d 100644
--- a/notes_and_schedule.mdwn
+++ b/notes_and_schedule.mdwn
@@ -1,26 +1,18 @@
-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.