need empty? for set questions
[lambda.git] / content.mdwn
index 45f8557..a546e9d 100644 (file)
@@ -37,6 +37,7 @@ week in which they were introduced.
         *   [[Some other list encodings|topics/week3 lists#other-lists]]
     *    Reduction Strategies and Normal Forms
     *   [[Fixed point combinators|topics/week4_fixed_point_combinators]]
+    *   [[More about fixed point combinators|topics/week4_more_about_fixed_point_combinators]]
 
 
 *    [[Combinatory Logic|topics/week3 combinatory logic]]
@@ -63,20 +64,20 @@ 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.*
+*These notes were developed over the course of the week. It'd be a good idea to review them again now, to be sure you've read all the content.*
 
 *   [[Arithmetic with Church numbers|topics/week3_church_arithmetic]]
-*   [[More on Lists|topics/week3 lists]] (expanded on Sunday)
+*   [[More on Lists|topics/week3 lists]]
 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
-*   [[Unit and its usefulness|topics/week3 unit]] (posted on Wednesday)
-*   [[Combinatory Logic|topics/week3 combinatory logic]] (revised on Monday and Tuesday)
+*   Reduction Strategies and Normal Forms (will try to post soon)
+*   [[Unit and its usefulness|topics/week3 unit]]
+*   [[Combinatory Logic|topics/week3 combinatory logic]]
 *   [[Homework for week 3|exercises/assignment3]]
 
 Week 4:
 
 *   [[Fixed point combinators|topics/week4_fixed_point_combinators]]
-*   More on fixed point combinators (in progress)
+*   [[More about fixed point combinators|topics/week4_more_about_fixed_point_combinators]]
 *   Towards types (in progress)