Merge branch 'working'
[lambda.git] / content.mdwn
index ab68131..488e888 100644 (file)
@@ -7,6 +7,8 @@ week in which they were introduced.
 
 *   [[What is computation?|topics/week3_what_is_computation]]
 
+*   [[Kaplan on Plexy|topics/week6_plexy]]
+
 *   Functional Programming
 
     *   [[Introduction|topics/week1 kapulet intro]]
@@ -14,16 +16,22 @@ week in which they were introduced.
     *   [["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|topics/week3 lists#comprehensions]]
-    *   Usefulness of `()`
+    *   [[Unit and its usefulness|topics/week3 unit]]
     *   More tips on using Scheme
+    *   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
+    *   Untyped lambda evaluator ([[in browser|code/lambda_evaluator]]) ([[for home|topics/week7_untyped_evaluator]])
+
 
 *   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]]
+    *   Combinatory evaluator ([[for home|topics/week7_combinatory_evaluator]])
 
-*   The Lambda Calculus
+*   The Untyped Lambda Calculus
 
     *   [[Introduction to the Lambda Calculus|topics/week2 lambda intro]]
     *   [[Advanced notes on the Lambda Calculus|topics/week2 lambda advanced]]
@@ -34,11 +42,30 @@ week in which they were introduced.
         *   [[Numbers|topics/week2 encodings#numbers]], v1 ("Church's encoding")
         *   [[Arithmetic with Church numbers|topics/week3_church_arithmetic]]
         *   [[How to get the `tail` of v1 lists?|topics/week3 lists#tails]]
-        *   Some other list encodings
-    *    Reduction Strategies and Normal Forms
+        *   [[Some other list encodings|topics/week3 lists#other-lists]]
+    *   [[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]]
+    *   Untyped lambda evaluator ([[in browser|code/lambda_evaluator]]) ([[for home|topics/week7_untyped_evaluator]])
+    *   [[Environments and Closures|topics/week7_environments_and_closures]]
+
+
+*   Combinatory logic
+
+    *   [[Introduction|topics/week3 combinatory logic]]
+    *   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]]
 
-*    [[Combinatory Logic|topics/week3 combinatory logic]]
 
 
 ## Topics by week ##
@@ -58,17 +85,52 @@ Week 2:
 *   [[Introduction to the Lambda Calculus|topics/week2 lambda intro]]
 *   [[Advanced notes on the Lambda Calculus|topics/week2 lambda advanced]]
 *   [[Encoding Booleans, Tuples, Lists, and Numbers|topics/week2 encodings]]
-*   [[Homework for week 2|exercises/assignment2]]
+*   [[Homework for week 2|exercises/assignment2]] ([[Answers|exercises/assignment2_answers]])
 
 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.*
-
 *   [[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 will discuss some other list encodings)
+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 `()`
+*   [[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]]
-*   [[Homework for week 3|exercises/assignment3]]
+*   [[Homework for week 3|exercises/assignment3]] ([[Answers|exercises/assignment3_answers]])
+
+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|exercises/assignment4_answers]])
+
+Week 5:
+
+*   [[Simply-typed lambda calculus|topics/week5 simply typed]]
+*   [[System F|topics/week5 system F]]
+*   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:
+
+*   [[footnote about "Plexy"|readings/kaplan-plexy.pdf]] from Kaplan's *Demonstratives* about Plexy; [[our notes|topics/week6_plexy]] comparing to the Maybe type
+*   (Recommended) [[King's discussion of Schiffer|readings/king-on-schiffer.pdf]] in Chapter 4 of *The Nature and Structure of Content* (2007)
+*   (Recommended) [[King's discussion of clausal complements and proposition-designators|readings/king-on-logicism.pdf]] from Chapter 5 of *The Nature and Structure of Content* (2007) <!-- reviews and elaborates his paper "[Designating propositions](http://philpapers.org/rec/KINDP)" -->
+*   Michael Rieppel, "[[Being Something: Properties and Predicative Quantification|readings/rieppel-beingsthg.pdf]]"
+
+Week 7:
+
+*   [[Combinatory evaluator|topics/week7_combinatory_evaluator]]
+*   [[Introducing Monads|topics/week7_introducing_monads]] (updated Mon 23 Mar)
+*   [[Homework for week 7|exercises/assignment7]] (updated Mon 23 Mar)
+*   [[Environments and Closures|topics/week7_environments_and_closures]]
+*   [[Untyped lambda evaluator|topics/week7_untyped_evaluator]]
+
+
+Week 8:
+
+*   [[Safe division with monads|topics/week8_safe_division_with_monads]]
+