X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=index.mdwn;h=a122c1da7bd7bdb4a423e8f592524c2b852da40e;hp=7adc9d5f8476f200464b8488bf9d8746277a719e;hb=02087e04c3c2ff53ec2e292d69ae2e1e6511af09;hpb=c34fbdb0806c93ae519eddec85bc7777e463b9b3

diff --git a/index.mdwn b/index.mdwn
index 7adc9d5f..a122c1da 100644
--- a/index.mdwn
+++ b/index.mdwn
@@ -110,11 +110,23 @@ The [[differences between our made-up language and Scheme, OCaml, and Haskell|ro
 [[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);
-[[Combinatory Logic|topics/week3 combinatory logic]];
+[[Unit and its usefulness|topics/week3 unit]] (posted on Wednesday);
+[[Combinatory Logic|topics/week3 combinatory logic]] (revised on Monday and Tuesday);
 [[Homework|exercises/assignment3]]
 
-> Also, by this point you should be able to handle all of *The Little Schemer* except for Chapters 9 and 10. Chapter 9 covers what is going on under the hood with `letrec`, and that will be our topic for next week.
+> Also, by this point you should be able to handle all of *The Little Schemer* except for Chapters 9 and 10. Chapter 9 covers what is going on under the hood with `letrec`, and that will be our topic for next week. You can also read Chapter 4 of Hankin on Combinatory Logic.
+
+> 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.
 
 
 <!--