add explanation of Closures
[lambda.git] / content.mdwn
index 6778ac8..84d3485 100644 (file)
@@ -21,15 +21,14 @@ week in which they were introduced.
     *   Types in OCaml and Haskell (will be posted someday)
     *   Practical advice for working with OCaml and/or Haskell (will be posted someday)
     *   [[Kaplan on Plexy|topics/week6_plexy]] and the Maybe type
-    *   Lambda evaluator
-    *   [[Introducing Monads|topics/week7_introducing_monads]]
+    *   Untyped lambda evaluator ([[in browser|code/lambda_evaluator]]) (for home)
 
 *   Order, "static versus dynamic"
 
     *   [[Order in programming languages and natural language|topics/week1 order]]
     *   [[Reduction Strategies and Normal Forms in the Lambda Calculus|topics/week3_evaluation_order]]
     *   [[Unit and its usefulness|topics/week3 unit]]
-    *   [[Combinatory evaluator|topics/week7_combinatory_evaluator]]
+    *   Combinatory evaluator ([[for home|topics/week7_combinatory_evaluator]])
 
 *   The Untyped Lambda Calculus
 
@@ -46,19 +45,24 @@ week in which they were introduced.
     *   [[Reduction Strategies and Normal Forms|topics/week3_evaluation_order]]
     *   [[Fixed point combinators|topics/week4_fixed_point_combinators]]
     *   [[More about fixed point combinators|topics/week4_more_about_fixed_point_combinators]]
-    *   Interpreter for Lambda terms
+    *   Untyped lambda evaluator ([[in browser|code/lambda_evaluator]]) (for home)
 
 *   Combinatory logic
 
     *   [[Introduction|topics/week3 combinatory logic]]
-    *   [[Combinatory evaluator|topics/week7_combinatory_evaluator]]
+    *   Combinatory evaluator ([[for home|topics/week7_combinatory_evaluator]])
 
 *   Typed Lambda Calculi
 
     *   [[Simply-typed lambda calculus|topics/week5 simply typed]] (will be updated)
     *   [[System F|topics/week5 system F]] (will be updated)
     *   Types in OCaml and Haskell (will be posted someday)
+    *   see also Monads links, below
+
+*   Monads
     *   [[Introducing Monads|topics/week7_introducing_monads]]
+    *   [[Safe division with monads|topics/week8_safe_division_with_monads]]
+
 
 
 ## Topics by week ##
@@ -82,8 +86,6 @@ Week 2:
 
 Week 3:
 
-*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]]
 Introduces list comprehensions, discusses how to get the `tail` of lists in the Lambda Calculus, and some new list encodings
@@ -98,7 +100,7 @@ Week 4:
 *   [[Fixed point combinators|topics/week4_fixed_point_combinators]]
 *   [[More about fixed point combinators|topics/week4_more_about_fixed_point_combinators]]
 *   Towards types (in progress)
-*   [[Homework for week 4|exercises/assignment4]] (Answers will be posted soon)
+*   [[Homework for week 4|exercises/assignment4]] ([[Answers|exercises/assignment4_answers]])
 
 Week 5:
 
@@ -119,6 +121,11 @@ Week 6:
 Week 7:
 
 *   [[Combinatory evaluator|topics/week7_combinatory_evaluator]]
-*   Lambda evaluator (will be posted soon)
-*   [[Introducing Monads|topics/week7_introducing_monads]] (updated Fri 20 Mar)
+*   Untyped lambda evaluator (will be posted soon)
+*   [[Introducing Monads|topics/week7_introducing_monads]] (updated Mon 23 Mar)
 *   [[Homework for week 7|exercises/assignment7]]
+
+Week 8:
+
+*   [[Safe division with monads|topics/week8_safe_division_with_monads]]
+