X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=content.mdwn;h=6bcc55e18b8900440ab99c5a951cbe4004d61a48;hp=01f05bcc8a5248110635ba8a2dc3aabd12d12e93;hb=de74e6bac683afd7a0d6c64716814ac6c4942c6b;hpb=4bef10ffc0c1fa2fbc91b24c2b360aa679d77e89

diff --git a/content.mdwn b/content.mdwn
index 01f05bcc..6bcc55e1 100644
--- a/content.mdwn
+++ b/content.mdwn
@@ -14,14 +14,14 @@ week in which they were introduced.
     *   [["Rosetta Stone" page #1 for Kaupulet, Scheme, OCaml, Haskell|rosetta1]]
     *   Offsite links for help on [[learning Scheme]], [[OCaml|learning OCaml]], and [[Haskell|learning Haskell]]
     *   [[List Comprehensions|topics/week3 lists#comprehensions]]
-    *   Usefulness of `()`
+    *   [[Unit and its usefulness|topics/week3 unit]]
     *   More tips on using Scheme
 
 *   Order, "static versus dynamic"
 
-    *    [[Order in programming languages and natural language|topics/week1 order]]
-    *    Reduction Strategies and Normal Forms in the Lambda Calculus
-    *   Usefulness of `()`
+    *   [[Order in programming languages and natural language|topics/week1 order]]
+    *   [[Reduction Strategies and Normal Forms in the Lambda Calculus|topics/week3_evaluation_order]]
+    *   [[Unit and its usefulness|topics/week3 unit]]
 
 *   The Lambda Calculus
 
@@ -35,7 +35,9 @@ week in which they were introduced.
         *   [[Arithmetic with Church numbers|topics/week3_church_arithmetic]]
         *   [[How to get the `tail` of v1 lists?|topics/week3 lists#tails]]
         *   [[Some other list encodings|topics/week3 lists#other-lists]]
-    *    Reduction Strategies and Normal Forms
+    *   [[Reduction Strategies and Normal Forms|topics/week3_evaluation_order]]
+    *   [[Fixed point combinators|topics/week4_fixed_point_combinators]]
+    *   [[More about fixed point combinators|topics/week4_more_about_fixed_point_combinators]]
 
 
 *    [[Combinatory Logic|topics/week3 combinatory logic]]
@@ -62,13 +64,21 @@ Week 2:
 
 Week 3:
 
-*We will continue to develop these notes over the next few days. Expect some of the notes already posted to be expanded, and more notes to appear.*
+*These notes were developed over the course of the week. It'd be a good idea to review them again now, to be sure you've read all the content.*
 
 *   [[Arithmetic with Church numbers|topics/week3_church_arithmetic]]
-*   [[More on Lists|topics/week3 lists]] (expanded on Sunday)
+*   [[More on Lists|topics/week3 lists]]
 Introduces list comprehensions, discusses how to get the `tail` of lists in the Lambda Calculus, and some new list encodings
 *   [[What is computation?|topics/week3_what_is_computation]]
-*   Reduction Strategies and Normal Forms
-*   Usefulness of `()`
-*   [[Combinatory Logic|topics/week3 combinatory logic]] (revised on Monday and Tuesday)
-*   [[Homework for week 3|exercises/assignment3]]
+*   [[Reduction Strategies and Normal Forms|topics/week3_evaluation_order]] (posted on Monday 23 Feb)
+*   [[Unit and its usefulness|topics/week3 unit]]
+*   [[Combinatory Logic|topics/week3 combinatory logic]]
+*   [[Homework for week 3|exercises/assignment3]] ([[Answers|exercises/assignment3_answers]])
+
+Week 4:
+
+*   [[Fixed point combinators|topics/week4_fixed_point_combinators]]
+*   [[More about fixed point combinators|topics/week4_more_about_fixed_point_combinators]]
+*   Towards types (in progress)
+*   [[Homework for week 4|exercises/assignment4]]
+