X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=index.mdwn;h=9fd9d69de28252f80b414898f90eb91c1c8205e7;hp=7b39b98168b89bf8ebe851013021b8eb00fb5f3f;hb=0e07032ec1fdb3dae922e91a8edc1d6802dc982f;hpb=07ebc9292a8db8b98707232d2d01717293f473e9

diff --git a/index.mdwn b/index.mdwn
index 7b39b981..9fd9d69d 100644
--- a/index.mdwn
+++ b/index.mdwn
@@ -100,6 +100,16 @@ The [[differences between our made-up language and Scheme, OCaml, and Haskell|ro
 
 > We posted [[answers to Week 1's homework|exercises/assignment1_answers]].
 
+(**Week 3**) Thursday 12 February 2015
+> Topics:
+More on Lists (in progress);
+Combinatory Logic (in progress);
+Reduction Strategies and Normal Forms (in progress);
+Homework (in progress)
+
+> 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.
+
+
 <!--
 We've added a [[Monad Library]] for OCaml.
 We've posted a [[State Monad Tutorial]].