X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=week2.mdwn;h=992c8c8975efd62467f72b8e7c6458460f004135;hp=8a67e8fdac03c1d9bbdf33337a247bf0958f3bee;hb=600b9e54be61643b0d85021bfbfbd575f47b0d17;hpb=de2a6c8e1fa680ba11313515b13b897e63d365b1

diff --git a/week2.mdwn b/week2.mdwn
index 8a67e8fd..992c8c89 100644
--- a/week2.mdwn
+++ b/week2.mdwn
@@ -48,7 +48,7 @@ Here's more to read about combinatorial logic:
 <http://people.cs.uu.nl/jeroen/article/combinat/combinat.ps>
 
 
-Evaluation strategies and Normalization
+Evaluation Strategies and Normalization
 =======================================
 
 In the assignment we asked you to reduce various expressions until it wasn't possible to reduce them any further. For two of those expressions, this was impossible to do. One of them was this:
@@ -207,7 +207,4 @@ But is there any method for doing this in general---for telling, of any given co
 
 ##[[Lists and Numbers]]##
 
-How to do with recursion with omega.
-
-Next week: fixed point combinators