post homework3 and some more link-promises

diff --git a/content.mdwn b/content.mdwn
index d4b51d1..a71f620 100644 (file)
--- a/content.mdwn
+++ b/content.mdwn
@@ -14,11 +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 `()`
+    *   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 `()`
 
 *   The Lambda Calculus
 
@@ -30,6 +33,8 @@ week in which they were introduced.
         *   [[Lists|topics/week2 encodings#lists]], v1 (as right-folds)
         *   [[Numbers|topics/week2 encodings#numbers]], v1 ("Church's encoding")
         *   [[How to get the `tail` of v1 lists?|topics/week3 lists#tails]]
+        *   Some other list encodings
+        *   Arithmetic with Church numbers
     *    Reduction Strategies and Normal Forms
 
 
@@ -57,12 +62,16 @@ 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.*
+
+*   Arithmetic with Church numbers
 *   [[What is computation?|topics/week3_what_is_computation]]
 *   [[More on Lists|topics/week3 lists]]
-Introduces list comprehensions, discusses how to get the `tail` of lists in the Lambda Calculus
+Introduces list comprehensions, discusses how to get the `tail` of lists in the Lambda Calculus (and will discuss some other list encodings)
 *   [[Combinatory Logic|topics/week3 combinatory logic]]
 *   Reduction Strategies and Normal Forms
-*   Homework for week 3
+*   Usefulness of `()`
+*   [[Homework for week 3|exercises/assignment3]]