X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=content.mdwn;h=18098797ea0ec0186a76aa757b69476c0b03cbd9;hp=ffe628800386c5bae981c901f098f0c45508141f;hb=171fca9fa874dab55a125b4e779e969c677666e4;hpb=957c10dcb822689bffd79fecf63236470dd7049d;ds=sidebyside

diff --git a/content.mdwn b/content.mdwn
index ffe62880..18098797 100644
--- a/content.mdwn
+++ b/content.mdwn
@@ -5,18 +5,23 @@ week in which they were introduced.
 
 ## Topics by content ##
 
+*   [[What is computation?|topics/week3_what_is_computation]]
+
 *   Functional Programming
 
     *   [[Introduction|topics/week1 kapulet intro]]
     *   [[Week 1 Advanced notes|topics/week1 kapulet advanced]]
     *   [["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
+    *   [[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
 
@@ -27,11 +32,13 @@ week in which they were introduced.
         *   [[Tuples|topics/week2 encodings#tuples]]
         *   [[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?
+        *   [[Arithmetic with Church numbers|topics/week3_church_arithmetic]]
+        *   [[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
 
 
-*    Combinatorial Logic
+*    [[Combinatory Logic|topics/week3 combinatory logic]]
 
 
 ## Topics by week ##
@@ -44,7 +51,7 @@ This discussion considers conjunction in a language that recognized presuppositi
 Basics of functional programming: `let`, `case`, pattern matching, and
 recursion.  Definitions of factorial.
 *   [[Advanced notes on functional programming|topics/week1 kapulet advanced]]
-*   [[Homework for week 1|exercises/assignment1]]
+*   [[Homework for week 1|exercises/assignment1]] ([[Answers|exercises/assignment1_answers]])
 
 Week 2:
 
@@ -55,13 +62,13 @@ Week 2:
 
 Week 3:
 
-*   More on Lists
-Introduces list comprehensions, discusses how to get the `tail` of lists in the Lambda Calculus
-*   Combinatorial Logic
-*   Reduction Strategies and Normal Forms
-*   Homework for week 3
-
-
-
-*More coming, please wait...*
+*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]]
+*   Reduction Strategies and Normal Forms
+*   Usefulness of `()`
+*   [[Combinatory Logic|topics/week3 combinatory logic]]
+*   [[Homework for week 3|exercises/assignment3]]