edits

[lambda.git] / index.mdwn

diff --git a/index.mdwn b/index.mdwn
index 0390350..f5dd971 100644 (file)
--- a/index.mdwn
+++ b/index.mdwn
@@ -109,8 +109,8 @@ 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);
-Usefulness of `()` (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]]
 
@@ -118,6 +118,19 @@ Usefulness of `()` (in progress);
 
 > We posted [[answers to Week 2's homework|exercises/assignment2_answers]].
 
+(**Week 4**) Thursday 19 February 2015
+
+> Topics: [[!img images/tabletop_roleplaying.png size="240x240" alt="Hey, no recursing"]]
+[[Yes, recursing|topics/week4_fixed_point_combinators]];
+[[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.
+
+> We posted [[answers to Week 3's homework|exercises/assignment3_answers]].
+
+
 <!--
 We've added a [[Monad Library]] for OCaml.
 We've posted a [[State Monad Tutorial]].