X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=content.mdwn;h=21a4a0776caca775eba43b970fc6507d6771c2ec;hp=18098797ea0ec0186a76aa757b69476c0b03cbd9;hb=fcd4682b70fd70f1f34698896a0b2706655ac4f1;hpb=0e19f626ff75a75df5c2f7f1ad743a283f3a2d70

diff --git a/content.mdwn b/content.mdwn
index 18098797..21a4a077 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"
@@ -58,7 +58,7 @@ 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:
 
@@ -69,6 +69,6 @@ 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 `()`
-*   [[Combinatory Logic|topics/week3 combinatory logic]]
+*   [[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]]