X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=index.mdwn;h=73f77f2d144ff8e9603415550a28af96f05cea06;hp=0c072c85cf0f43e4b3cffea6f1d851d74e8daceb;hb=89121328344917225949cb675a6706cbcd0f83d9;hpb=49bee29e4cf916d3d8e5ac581bf1d1a3dd00f3f8

diff --git a/index.mdwn b/index.mdwn
index 0c072c85..73f77f2d 100644
--- a/index.mdwn
+++ b/index.mdwn
@@ -118,6 +118,16 @@ Reduction Strategies and Normal Forms (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 on fixed point combinators (in progress);
+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.
+
+
 <!--
 We've added a [[Monad Library]] for OCaml.
 We've posted a [[State Monad Tutorial]].