add addl reading section

[lambda.git] / content.mdwn

diff --git a/content.mdwn b/content.mdwn
index 1ec4a92..5d8dbb1 100644 (file)
--- a/content.mdwn
+++ b/content.mdwn
@@ -18,17 +18,18 @@ week in which they were introduced.
     *   [[List Comprehensions|topics/week3 lists#comprehensions]]
     *   [[Unit and its usefulness|topics/week3 unit]]
     *   More tips on using Scheme
     *   [[List Comprehensions|topics/week3 lists#comprehensions]]
     *   [[Unit and its usefulness|topics/week3 unit]]
     *   More tips on using Scheme

-    *   Types in OCaml and Haskell (will be posted soon)
-    *   Practical advice for working with OCaml and/or Haskell (will be posted soon)
+    *   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
     *   [[Kaplan on Plexy|topics/week6_plexy]] and the Maybe type

-    *   Interpreter for Lambda terms
-    *   Starting with Monads
+    *   Lambda evaluator
+    *   [[Introducing Monads|topics/week7_introducing_monads]]

 
 *   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]]
 
 *   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]]

 
 *   The Untyped Lambda Calculus
 
 
 *   The Untyped Lambda Calculus
 


@@ -50,14 +51,14 @@ week in which they were introduced.
 *   Combinatory logic
 
     *   [[Introduction|topics/week3 combinatory logic]]
 *   Combinatory logic
 
     *   [[Introduction|topics/week3 combinatory logic]]

-    *   Interpreter for Combinatory Logic terms
+    *   [[Combinatory evaluator|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)
 
 *   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 soon)
-    *   Starting with Monads
+    *   Types in OCaml and Haskell (will be posted someday)
+    *   [[Introducing Monads|topics/week7_introducing_monads]]

 
 
 ## Topics by week ##
 
 
 ## Topics by week ##


@@ -81,8 +82,6 @@ Week 2:
 
 Week 3:
 
 
 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
 *   [[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


@@ -97,17 +96,16 @@ 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)
 *   [[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]]
+*   [[Homework for week 4|exercises/assignment4]] ([[Answers|exercises/assignment4_answers]])

 
 Week 5:
 
 
 Week 5:
 

-*Note*: Jim will be updating and expanding the lecture notes by Tuesday, but doesn't want to delay any longer letting you have access to the drafts we (in part) presented from in seminar. But do come back and re-read the pages when the expanded versions are posted.
-

 *   [[Simply-typed lambda calculus|topics/week5 simply typed]]
 *   [[System F|topics/week5 system F]]
 *   [[Simply-typed lambda calculus|topics/week5 simply typed]]
 *   [[System F|topics/week5 system F]]

-*   Types in OCaml and Haskell (will be posted soon)
-*   Practical advice for working with OCaml and/or Haskell (will be posted soon)
-*   [[Homework for weeks 5 and 6|exercises/assignment5]]
+*   Types in OCaml and Haskell (will be posted someday)
+*   Practical advice for working with OCaml and/or Haskell (will be posted someday)
+*   [[Homework for weeks 5 and 6|exercises/assignment5]] ([[Answers|exercises/assignment5_answers]])
+

 
 Week 6:
 
 
 Week 6:
 


@@ -118,8 +116,7 @@ Week 6:
 
 Week 7:
 
 
 Week 7:
 

-*   Interpreter for Combinatory Logic terms
-*   Interpreter for Lambda terms
-*   Starting with Monads
-
-
+*   [[Combinatory evaluator|topics/week7_combinatory_evaluator]]
+*   Lambda evaluator (will be posted soon)
+*   [[Introducing Monads|topics/week7_introducing_monads]] (updated Fri 20 Mar)
+*   [[Homework for week 7|exercises/assignment7]]