(no commit message)

[lambda.git] / index.mdwn

diff --git a/index.mdwn b/index.mdwn
index 73f77f2..b352d58 100644 (file)
--- 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]]
@@ -122,11 +122,16 @@ Reduction Strategies and Normal Forms (in progress);
 
 > Topics: [[!img images/tabletop_roleplaying.png size="240x240" alt="Hey, no recursing"]]
 [[Yes, recursing|topics/week4_fixed_point_combinators]];
-More on fixed point combinators (in progress);
-Towards types (in progress)
+[[More about fixed point combinators|topics/week4_more_about_fixed_point_combinators]];
+Towards types (in progress);
+[[Homework|exercises/assignment4]]
 
 > 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.