[[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);
+[[Reduction Strategies and Normal Forms|topics/week3_evaluation_order]] (posted on Monday 23 Feb);
[[Unit and its usefulness|topics/week3 unit]] (posted on Wednesday);
[[Combinatory Logic|topics/week3 combinatory logic]] (revised on Monday and Tuesday);
[[Homework|exercises/assignment3]]
(**Week 4**) Thursday 19 February 2015
> Topics: [[!img images/tabletop_roleplaying.png size="240x240" alt="Hey, no recursing"]]
-Yes, recursing (in progress);
-Towards types (in progress)
+[[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.
+> We posted [[answers to Week 3's homework|exercises/assignment3_answers]].
+
<!--
We've added a [[Monad Library]] for OCaml.