X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=content.mdwn;h=a546e9d8ca2fc083f901ab252b303f4c4200804e;hp=ab681318509d5f30fc7675367e56c5d56c8bed1e;hb=4e92456d3dda2c68b8ff0151a0d01fa0750c1971;hpb=e51d4e8f1aaeaeba9d2527f7469582adba886a02

diff --git a/content.mdwn b/content.mdwn
index ab681318..a546e9d8 100644
--- a/content.mdwn
+++ b/content.mdwn
@@ -14,7 +14,7 @@ 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"
@@ -34,8 +34,10 @@ week in which they were introduced.
         *   [[Numbers|topics/week2 encodings#numbers]], v1 ("Church's encoding")
         *   [[Arithmetic with Church numbers|topics/week3_church_arithmetic]]
         *   [[How to get the `tail` of v1 lists?|topics/week3 lists#tails]]
-        *   Some other list encodings
+        *   [[Some other list encodings|topics/week3 lists#other-lists]]
     *    Reduction Strategies and Normal Forms
+    *   [[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]]
@@ -58,17 +60,24 @@ Week 2:
 *   [[Introduction to the Lambda Calculus|topics/week2 lambda intro]]
 *   [[Advanced notes on the Lambda Calculus|topics/week2 lambda advanced]]
 *   [[Encoding Booleans, Tuples, Lists, and Numbers|topics/week2 encodings]]
-*   [[Homework for week 2|exercises/assignment2]]
+*   [[Homework for week 2|exercises/assignment2]] ([[Answers|exercises/assignment2_answers]])
 
 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]]
-Introduces list comprehensions, discusses how to get the `tail` of lists in the Lambda Calculus (and will discuss some other list encodings)
+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 `()`
+*   Reduction Strategies and Normal Forms (will try to post soon)
+*   [[Unit and its usefulness|topics/week3 unit]]
 *   [[Combinatory Logic|topics/week3 combinatory logic]]
 *   [[Homework for week 3|exercises/assignment3]]
+
+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)
+