XGitUrl: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=content.mdwn;h=cd409666e7f34d47fc5584864bf86d55559245cd;hp=6b1153721e9d03a8246bed8de0fd654c53eb3ea1;hb=291555207a30b07dd33b3d493ca863bc64ea9edb;hpb=47a4a5cfd372653eba6fabc8d7ba6a76247bcc8c
diff git a/content.mdwn b/content.mdwn
index 6b115372..cd409666 100644
 a/content.mdwn
+++ b/content.mdwn
@@ 7,6 +7,8 @@ week in which they were introduced.
* [[What is computation?topics/week3_what_is_computation]]
+* [[Kaplan on Plexytopics/week6_plexy]]
+
* Functional Programming
* [[Introductiontopics/week1 kapulet intro]]
@@ 16,14 +18,24 @@ week in which they were introduced.
* [[List Comprehensionstopics/week3 lists#comprehensions]]
* [[Unit and its usefulnesstopics/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 Plexytopics/week6_plexy]] and the Maybe type
+ * Untyped lambda evaluator ([[in browsercode/lambda_evaluator]]) ([[for hometopics/week7_untyped_evaluator]])
+ * [[Ramble on Monads and Modulestopics/week8_monads_and_modules]]
+ * [[Installing and Using the Juli8 Libraries/juli8]]
+ * [[Programming with mutable state/topics/week9_mutable_state]]
+
* Order, "static versus dynamic"
 * [[Order in programming languages and natural languagetopics/week1 order]]
 * Reduction Strategies and Normal Forms in the Lambda Calculus
 * Usefulness of `()`
+ * [[Order in programming languages and natural languagetopics/week1 order]]
+ * [[Reduction Strategies and Normal Forms in the Lambda Calculustopics/week3_evaluation_order]]
+ * [[Unit and its usefulnesstopics/week3 unit]]
+ * Combinatory evaluator ([[for hometopics/week7_combinatory_evaluator]])
+ * [[Programming with mutable state/topics/week9_mutable_state]]
* The Lambda Calculus
+* The Untyped Lambda Calculus
* [[Introduction to the Lambda Calculustopics/week2 lambda intro]]
* [[Advanced notes on the Lambda Calculustopics/week2 lambda advanced]]
@@ 35,12 +47,34 @@ week in which they were introduced.
* [[Arithmetic with Church numberstopics/week3_church_arithmetic]]
* [[How to get the `tail` of v1 lists?topics/week3 lists#tails]]
* [[Some other list encodingstopics/week3 lists#otherlists]]
 * Reduction Strategies and Normal Forms
+ * [[Reduction Strategies and Normal Formstopics/week3_evaluation_order]]
* [[Fixed point combinatorstopics/week4_fixed_point_combinators]]
* [[More about fixed point combinatorstopics/week4_more_about_fixed_point_combinators]]
+ * Untyped lambda evaluator ([[in browsercode/lambda_evaluator]]) ([[for hometopics/week7_untyped_evaluator]])
+ * [[Environments and Closurestopics/week7_environments_and_closures]]
+
+
+* Combinatory logic
+
+ * [[Introductiontopics/week3 combinatory logic]]
+ * Combinatory evaluator ([[for hometopics/week7_combinatory_evaluator]])
+* Typed Lambda Calculi
* [[Combinatory Logictopics/week3 combinatory logic]]
+ * [[Simplytyped lambda calculustopics/week5 simply typed]] (will be updated)
+ * [[System Ftopics/week5 system F]] (will be updated)
+ * Types in OCaml and Haskell (will be posted someday)
+ * see also Monads links, below
+
+* Monads
+ * [[Introducing Monadstopics/week7_introducing_monads]]
+ * [[Safe division with monadstopics/week8_safe_division_with_monads]]
+ * [[Reader Monad/topics/week8_reader_monad]]
+ * [[Ramble on Monads and Modulestopics/week8_monads_and_modules]]
+ * [[Using the OCaml Monad library/topics/week9_using_the_monad_library]]
+ * [[Programming with mutable state/topics/week9_mutable_state]]
+ * [[A State Monad Tutorial/topics/week9_state_monad_tutorial]]
+ * [[Using multiple monads together/topics/week9_monad_transformers]]
## Topics by week ##
@@ 64,13 +98,11 @@ 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 numberstopics/week3_church_arithmetic]]
* [[More on Liststopics/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 Formstopics/week3_evaluation_order]] (posted on Monday 23 Feb)
* [[Unit and its usefulnesstopics/week3 unit]]
* [[Combinatory Logictopics/week3 combinatory logic]]
* [[Homework for week 3exercises/assignment3]] ([[Answersexercises/assignment3_answers]])
@@ 80,4 +112,48 @@ Week 4:
* [[Fixed point combinatorstopics/week4_fixed_point_combinators]]
* [[More about fixed point combinatorstopics/week4_more_about_fixed_point_combinators]]
* Towards types (in progress)
* [[Homework for week 4exercises/assignment4]]
+* [[Homework for week 4exercises/assignment4]] ([[Answersexercises/assignment4_answers]])
+
+Week 5:
+
+* [[Simplytyped lambda calculustopics/week5 simply typed]]
+* [[System Ftopics/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 6exercises/assignment56]] ([[Answersexercises/assignment56_answers]])
+
+
+Week 6:
+
+* [[footnote about "Plexy"readings/kaplanplexy.pdf]] from Kaplan's *Demonstratives* about Plexy; [[our notestopics/week6_plexy]] comparing to the Maybe type
+* (Recommended) [[King's discussion of Schifferreadings/kingonschiffer.pdf]] in Chapter 4 of *The Nature and Structure of Content* (2007)
+* (Recommended) [[King's discussion of clausal complements and propositiondesignatorsreadings/kingonlogicism.pdf]] from Chapter 5 of *The Nature and Structure of Content* (2007)
+* Michael Rieppel, "[[Being Something: Properties and Predicative Quantificationreadings/rieppelbeingsthg.pdf]]"
+
+Week 7:
+
+* [[Combinatory evaluatortopics/week7_combinatory_evaluator]]
+* [[Introducing Monadstopics/week7_introducing_monads]] (updated Mon 23 Mar)
+* [[Homework for week 7exercises/assignment7]] (updated Mon 23 Mar)
+* [[Environments and Closurestopics/week7_environments_and_closures]]
+* [[Untyped lambda evaluatortopics/week7_untyped_evaluator]]
+
+
+Week 8:
+
+* [[Safe division with monadstopics/week8_safe_division_with_monads]]
+* [[Reader Monad/topics/week8_reader_monad]]
+* [[Ramble on Monads and Modulestopics/week8_monads_and_modules]]
+
+Week 9:
+
+* [[Installing and Using the Juli8 Libraries/juli8]]
+* [[Using the OCaml Monad library/topics/week9_using_the_monad_library]]
+* [[Programming with mutable state/topics/week9_mutable_state]]
+* [[A State Monad Tutorial/topics/week9_state_monad_tutorial]]
+* [[Using multiple monads together/topics/week9_monad_transformers]]
+* [[Homework for weeks 89/exercises/assignment89]]
+
+Week 10:
+
+* Groenendijk, Stokhof, and Veltman, "[[Coreference and Modality/readings/coreferenceandmodality.pdf]]" (1996)