X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=content.mdwn;h=5d8dbb110a9b759c99aa7b5b609d54881ef03476;hp=01f05bcc8a5248110635ba8a2dc3aabd12d12e93;hb=1cf93986ef5e7a09e84cf8ba02d671bd5da7b0ab;hpb=4bef10ffc0c1fa2fbc91b24c2b360aa679d77e89 diff --git a/content.mdwn b/content.mdwn index 01f05bcc..5d8dbb11 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 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 + * 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]] @@ -35,10 +43,22 @@ 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]] - * 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 ## @@ -62,13 +82,41 @@ Week 2: 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]] (expanded on Sunday) +* [[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 -* Usefulness of `()` -* [[Combinatory Logic|topics/week3 combinatory logic]] (revised on Monday and Tuesday) -* [[Homework for week 3|exercises/assignment3]] +* [[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) +* 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]]