> 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|topics/week3_church_arithmetic]];
+[[More on Lists|topics/week3 lists]] (expanded on Sunday);
+[[What is computation?|topics/week3_what_is_computation]];
Reduction Strategies and Normal Forms (in progress);
-Homework (in progress)
+Usefulness of `()` (in progress);
+[[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]].
<!--
We've added a [[Monad Library]] for OCaml.