rename topics/_week4_fixed_point_combinator.mdwn to topics/_week4_fixed_point_combina...

[lambda.git] / content.mdwn

diff --git a/content.mdwn b/content.mdwn
index 0a6fa2d..21a4a07 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"
@@ -34,7 +34,7 @@ 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
 
 
@@ -58,18 +58,17 @@ 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.*
 
 *   [[Arithmetic with Church numbers|topics/week3_church_arithmetic]]
+*   [[More on Lists|topics/week3 lists]] (expanded on Sunday)
+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]]
-*   [[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)
-*   [[Combinatory Logic|topics/week3 combinatory logic]]
 *   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]]
-