X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=index.mdwn;h=cc974701f8221e094984d9ceb7bff369fced560e;hp=6a3c3f23d3df8185290d2d66b1a4db2d04a98eb3;hb=b78913233fb5db8dc92cf8359d823c518a257a84;hpb=652d8e1aeb0c8cd79468aa1dba0ed5c8153013dd

diff --git a/index.mdwn b/index.mdwn
index 6a3c3f23..cc974701 100644
--- a/index.mdwn
+++ b/index.mdwn
@@ -121,11 +121,15 @@ Reduction Strategies and Normal Forms (in progress);
 (**Week 4**) Thursday 19 February 2015
 
 > Topics: [[!img images/tabletop_roleplaying.png size="240x240" alt="Hey, no recursing"]]
-Yes, recursing (in progress);
-Towards types (in progress)
+[[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.