index 6b11537..b5ecf20 100644 (file)
@@ -16,14 +16,16 @@ 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)

*   Order, "static versus dynamic"

*   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 `()`
+    *   [[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]]

-*   The Lambda Calculus
+*   The Untyped Lambda Calculus

*   [[Introduction to the Lambda Calculus|topics/week2 lambda intro]]

*   [[Introduction to the Lambda Calculus|topics/week2 lambda intro]]
@@ -35,12 +37,17 @@ week in which they were introduced.
*   [[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]]
*   [[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
+    *   [[Reduction Strategies and Normal Forms|topics/week3_evaluation_order]]
*   [[Fixed point combinators|topics/week4_fixed_point_combinators]]

*   [[Fixed point combinators|topics/week4_fixed_point_combinators]]

+*   [[Combinatory Logic|topics/week3 combinatory logic]]
+
+*   Typed Lambda Calculi

-*    [[Combinatory Logic|topics/week3 combinatory logic]]
+    *   [[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)

## Topics by week ##

## Topics by week ##
@@ -70,7 +77,7 @@ Week 3:
*   [[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]]
*   [[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 (will try to post soon)
+*   [[Reduction Strategies and Normal Forms|topics/week3_evaluation_order]] (posted on Monday 23 Feb)
*   [[Unit and its usefulness|topics/week3 unit]]
*   [[Combinatory Logic|topics/week3 combinatory logic]]
*   [[Unit and its usefulness|topics/week3 unit]]
*   [[Combinatory Logic|topics/week3 combinatory logic]]
@@ -81,3 +88,21 @@ Week 4:
*   Towards types (in progress)
*   [[Homework for week 4|exercises/assignment4]]
*   Towards types (in progress)
*   [[Homework for week 4|exercises/assignment4]]
+
+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]]
+*   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]]
+