X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=schedule_of_topics.mdwn;h=52455c5ec94b4177cb8c4786d7d09b3e98f50597;hp=ca49980b521a0247cbf5f3f00111f0d3397a863f;hb=b0f79e526a5fe8fc606164bcffb5c31f23cc544b;hpb=9dee4176ba7c3094de0eb15fe800bdf2d17c36e2

diff --git a/schedule_of_topics.mdwn b/schedule_of_topics.mdwn
index ca49980b..52455c5e 100644
--- a/schedule_of_topics.mdwn
+++ b/schedule_of_topics.mdwn
@@ -14,10 +14,11 @@ This is very sketchy at this point, but it should give a sense of our intended s
 
 1.	Beta reduction
 2.	Substitution; using alpha-conversion and other strategies
-3.	Conversion versus Reduction
+3.	Conversion versus reduction
 4.	Eta reduction and "extensionality"
 5.	Different evaluation strategies (call by name, call by value, etc.)
 6.	Strongly normalizing vs weakly normalizing vs non-normalizing; Church-Rosser Theorem(s)
+6.	Lambda calculus compared to combinatorial logic
 
 7.	Encoding pairs (and triples and ...)
 8.	Encoding booleans
@@ -28,7 +29,7 @@ This is very sketchy at this point, but it should give a sense of our intended s
 13.	Representing lists as folds
 14.	Typical higher-order functions: map, filter, fold
 
-15.	Recursion exploiting the fold-like representation of numbers and lists (deforestation, zippers)
+15.	Recursion exploiting the fold-like representation of numbers and lists ([deforestation](http://en.wikipedia.org/wiki/Deforestation_%28computer_science%29), [zippers](http://en.wikipedia.org/wiki/Zipper_%28data_structure%29))
 16.	General recursion using omega
 17.	The Y combinator(s); more on evaluation strategies