* [[What is computation?|topics/week3_what_is_computation]]
+* [[Kaplan on Plexy|topics/week6_plexy]]
+
* Functional Programming
* [[Introduction|topics/week1 kapulet intro]]
* [[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 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]]
* 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|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]]
* [[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]]
* [[More about fixed point combinators|topics/week4_more_about_fixed_point_combinators]]
+ * Interpreter for Lambda terms
+
+* Combinatory logic
+ * [[Introduction|topics/week3 combinatory logic]]
+ * [[Combinatory evaluator|topics/week7_combinatory_evaluator]]
-* [[Combinatory Logic|topics/week3 combinatory logic]]
+* 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)
+ * [[Introducing Monads|topics/week7_introducing_monads]]
## Topics by week ##
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
* [[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]]
-* [[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]]
+* [[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]]
+* Lambda evaluator (will be posted soon)
+* [[Introducing Monads|topics/week7_introducing_monads]] (updated Fri 20 Mar)
+* [[Homework for week 7|exercises/assignment7]]