post main Y notes, stubs for others

[lambda.git] / content.mdwn

diff --git a/content.mdwn b/content.mdwn
index 01f05bc..45f8557 100644 (file)
--- 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"
@@ -36,6 +36,7 @@ week in which they were introduced.
         *   [[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
+    *   [[Fixed point combinators|topics/week4_fixed_point_combinators]]
 
 
 *    [[Combinatory Logic|topics/week3 combinatory logic]]
@@ -69,6 +70,13 @@ Week 3:
 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 `()`
+*   [[Unit and its usefulness|topics/week3 unit]] (posted on Wednesday)
 *   [[Combinatory Logic|topics/week3 combinatory logic]] (revised on Monday and Tuesday)
 *   [[Homework for week 3|exercises/assignment3]]
+
+Week 4:
+
+*   [[Fixed point combinators|topics/week4_fixed_point_combinators]]
+*   More on fixed point combinators (in progress)
+*   Towards types (in progress)
+