X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=index.mdwn;h=b352d58b8686010b3d6dec76e970f8df67e5f823;hp=a122c1da7bd7bdb4a423e8f592524c2b852da40e;hb=257df74b3048e6d5b59305ee83745a0bdc4153b1;hpb=6694165ac4d6edab602b3ad3651d0a5931b36a0e

diff --git a/index.mdwn b/index.mdwn
index a122c1da..b352d58b 100644
--- a/index.mdwn
+++ b/index.mdwn
@@ -109,7 +109,7 @@ The [[differences between our made-up language and Scheme, OCaml, and Haskell|ro
 [[Arithmetic with Church numbers|topics/week3_church_arithmetic]];
 [[More on Lists|topics/week3 lists]] (expanded on Sunday);
 [[What is computation?|topics/week3_what_is_computation]];
-Reduction Strategies and Normal Forms (in progress);
+[[Reduction Strategies and Normal Forms|topics/week3_evaluation_order]] (posted on Monday 23 Feb);
 [[Unit and its usefulness|topics/week3 unit]] (posted on Wednesday);
 [[Combinatory Logic|topics/week3 combinatory logic]] (revised on Monday and Tuesday);
 [[Homework|exercises/assignment3]]
@@ -128,6 +128,10 @@ Towards types (in progress);
 
 > Now you can read Sections 3.1 and 6.1 of Hankin; and browse the rest of Hankin Chapter 6, which should look somewhat familiar.
 
+> If you're reading along in the Pierce book, we've now covered much of the material in his Chapters 1-7.
+
+> We posted [[answers to Week 3's homework|exercises/assignment3_answers]].
+
 
 <!--
 We've added a [[Monad Library]] for OCaml.