X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=index.mdwn;h=f1d8aaadbbc1d3fefb3c614b367cb6800d2e121e;hp=af593b66bb29433883c4fad89a443edae8450a90;hb=b1718d63c9f2b15776a0ba5b5ebd1200d9d998b8;hpb=cdd2eadc0a38d4d42cf19648f3cb0f6fb8ff9995

diff --git a/index.mdwn b/index.mdwn
index af593b66..f1d8aaad 100644
--- a/index.mdwn
+++ b/index.mdwn
@@ -103,11 +103,17 @@ 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
+*We will continue to develop these notes over the next few days.*
+
 > Topics:
-More on Lists (in progress);
-Combinatory Logic (in progress);
+Arithmetic with Church numbers (in progress);
+[[What is computation?|topics/week3_what_is_computation]];
+[[More on Lists|topics/week3 lists]] (will be expanded);
+[[Combinatory Logic|topics/week3 combinatory logic]];
 Reduction Strategies and Normal Forms (in progress);
-Homework (in progress)
+Usefulness of `()` (in progress);
+[[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.