add explanation of Closures
[lambda.git] / content.mdwn
index d067df7..84d3485 100644 (file)
@@ -5,21 +5,127 @@ week in which they were introduced.
 
 ## Topics by content ##
 
-* [[Basics of functional programming|topics/week1]]
+*   [[What is computation?|topics/week3_what_is_computation]]
+
+*   [[Kaplan on Plexy|topics/week6_plexy]]
+
+*   Functional Programming
+
+    *   [[Introduction|topics/week1 kapulet intro]]
+    *   [[Week 1 Advanced notes|topics/week1 kapulet advanced]]
+    *   [["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]]
+    *   [[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)
+
+*   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 ([[for home|topics/week7_combinatory_evaluator]])
+
+*   The Untyped Lambda Calculus
+
+    *   [[Introduction to the Lambda Calculus|topics/week2 lambda intro]]
+    *   [[Advanced notes on the Lambda Calculus|topics/week2 lambda advanced]]
+    *   Encoding data types in the Lambda Calculus
+        *   [[Booleans|topics/week2 encodings#booleans]]
+        *   [[Tuples|topics/week2 encodings#tuples]]
+        *   [[Lists|topics/week2 encodings#lists]], v1 (as right-folds)
+        *   [[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|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)
+
+*   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]]
+
 
-* [[Order: static versus dynamic|topics/week1 order]]
 
 ## Topics by week ##
 
 Week 1:
 
-* [[Order in programming languages and natural language|topics/week1 order]]
+*   [[Order in programming languages and natural language|topics/week1 order]]
 This discussion considers conjunction in a language that recognized presupposition failure.
-* [[Introduction to functional programming|topics/week1]]
+*   [[Introduction to functional programming|topics/week1 kapulet intro]]
 Basics of functional programming: `let`, `case`, pattern matching, and
 recursion.  Definitions of factorial.
-* [[Homework for week 1|exercises/assignment1]]
-* [[Advanced notes|topics/week1 advanced notes]]
+*   [[Advanced notes on functional programming|topics/week1 kapulet advanced]]
+*   [[Homework for week 1|exercises/assignment1]] ([[Answers|exercises/assignment1_answers]])
+
+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]] ([[Answers|exercises/assignment2_answers]])
+
+Week 3:
+
+*   [[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|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]] ([[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]]
+*   Untyped lambda evaluator (will be posted soon)
+*   [[Introducing Monads|topics/week7_introducing_monads]] (updated Mon 23 Mar)
+*   [[Homework for week 7|exercises/assignment7]]
+
+Week 8:
 
-*More coming, please wait...*
+*   [[Safe division with monads|topics/week8_safe_division_with_monads]]