remove "in progress" on Juli8
[lambda.git] / content.mdwn
1 # Topics #
2
3 These topics are organized in two ways: by their content, and by the
4 week in which they were introduced.
5
6 ## Topics by content ##
7
8 *   [[What is computation?|topics/week3_what_is_computation]]
9
10 *   [[Kaplan on Plexy|topics/week6_plexy]]
11
12 *   Functional Programming
13
14     *   [[Introduction|topics/week1 kapulet intro]]
15     *   [[Week 1 Advanced notes|topics/week1 kapulet advanced]]
16     *   [["Rosetta Stone" page #1 for Kaupulet, Scheme, OCaml, Haskell|rosetta1]]
17     *   Offsite links for help on [[learning Scheme]], [[OCaml|learning OCaml]], and [[Haskell|learning Haskell]]
18     *   [[List Comprehensions|topics/week3 lists#comprehensions]]
19     *   [[Unit and its usefulness|topics/week3 unit]]
20     *   More tips on using Scheme
21     *   Types in OCaml and Haskell (will be posted someday)
22     *   Practical advice for working with OCaml and/or Haskell (will be posted someday)
23     *   [[Kaplan on Plexy|topics/week6_plexy]] and the Maybe type
24     *   Untyped lambda evaluator ([[in browser|code/lambda_evaluator]]) ([[for home|topics/week7_untyped_evaluator]])
25
26
27 *   Order, "static versus dynamic"
28
29     *   [[Order in programming languages and natural language|topics/week1 order]]
30     *   [[Reduction Strategies and Normal Forms in the Lambda Calculus|topics/week3_evaluation_order]]
31     *   [[Unit and its usefulness|topics/week3 unit]]
32     *   Combinatory evaluator ([[for home|topics/week7_combinatory_evaluator]])
33
34 *   The Untyped Lambda Calculus
35
36     *   [[Introduction to the Lambda Calculus|topics/week2 lambda intro]]
37     *   [[Advanced notes on the Lambda Calculus|topics/week2 lambda advanced]]
38     *   Encoding data types in the Lambda Calculus
39         *   [[Booleans|topics/week2 encodings#booleans]]
40         *   [[Tuples|topics/week2 encodings#tuples]]
41         *   [[Lists|topics/week2 encodings#lists]], v1 (as right-folds)
42         *   [[Numbers|topics/week2 encodings#numbers]], v1 ("Church's encoding")
43         *   [[Arithmetic with Church numbers|topics/week3_church_arithmetic]]
44         *   [[How to get the `tail` of v1 lists?|topics/week3 lists#tails]]
45         *   [[Some other list encodings|topics/week3 lists#other-lists]]
46     *   [[Reduction Strategies and Normal Forms|topics/week3_evaluation_order]]
47     *   [[Fixed point combinators|topics/week4_fixed_point_combinators]]
48     *   [[More about fixed point combinators|topics/week4_more_about_fixed_point_combinators]]
49     *   Untyped lambda evaluator ([[in browser|code/lambda_evaluator]]) ([[for home|topics/week7_untyped_evaluator]])
50     *   [[Environments and Closures|topics/week7_environments_and_closures]]
51
52
53 *   Combinatory logic
54
55     *   [[Introduction|topics/week3 combinatory logic]]
56     *   Combinatory evaluator ([[for home|topics/week7_combinatory_evaluator]])
57
58 *   Typed Lambda Calculi
59
60     *   [[Simply-typed lambda calculus|topics/week5 simply typed]] (will be updated)
61     *   [[System F|topics/week5 system F]] (will be updated)
62     *   Types in OCaml and Haskell (will be posted someday)
63     *   see also Monads links, below
64
65 *   Monads
66     *   [[Introducing Monads|topics/week7_introducing_monads]]
67     *   [[Safe division with monads|topics/week8_safe_division_with_monads]]
68
69
70
71 ## Topics by week ##
72
73 Week 1:
74
75 *   [[Order in programming languages and natural language|topics/week1 order]]
76 This discussion considers conjunction in a language that recognized presupposition failure.
77 *   [[Introduction to functional programming|topics/week1 kapulet intro]]
78 Basics of functional programming: `let`, `case`, pattern matching, and
79 recursion.  Definitions of factorial.
80 *   [[Advanced notes on functional programming|topics/week1 kapulet advanced]]
81 *   [[Homework for week 1|exercises/assignment1]] ([[Answers|exercises/assignment1_answers]])
82
83 Week 2:
84
85 *   [[Introduction to the Lambda Calculus|topics/week2 lambda intro]]
86 *   [[Advanced notes on the Lambda Calculus|topics/week2 lambda advanced]]
87 *   [[Encoding Booleans, Tuples, Lists, and Numbers|topics/week2 encodings]]
88 *   [[Homework for week 2|exercises/assignment2]] ([[Answers|exercises/assignment2_answers]])
89
90 Week 3:
91
92 *   [[Arithmetic with Church numbers|topics/week3_church_arithmetic]]
93 *   [[More on Lists|topics/week3 lists]]
94 Introduces list comprehensions, discusses how to get the `tail` of lists in the Lambda Calculus, and some new list encodings
95 *   [[What is computation?|topics/week3_what_is_computation]]
96 *   [[Reduction Strategies and Normal Forms|topics/week3_evaluation_order]] (posted on Monday 23 Feb)
97 *   [[Unit and its usefulness|topics/week3 unit]]
98 *   [[Combinatory Logic|topics/week3 combinatory logic]]
99 *   [[Homework for week 3|exercises/assignment3]] ([[Answers|exercises/assignment3_answers]])
100
101 Week 4:
102
103 *   [[Fixed point combinators|topics/week4_fixed_point_combinators]]
104 *   [[More about fixed point combinators|topics/week4_more_about_fixed_point_combinators]]
105 *   Towards types (in progress)
106 *   [[Homework for week 4|exercises/assignment4]] ([[Answers|exercises/assignment4_answers]])
107
108 Week 5:
109
110 *   [[Simply-typed lambda calculus|topics/week5 simply typed]]
111 *   [[System F|topics/week5 system F]]
112 *   Types in OCaml and Haskell (will be posted someday)
113 *   Practical advice for working with OCaml and/or Haskell (will be posted someday)
114 *   [[Homework for weeks 5 and 6|exercises/assignment5]] ([[Answers|exercises/assignment5_answers]])
115
116
117 Week 6:
118
119 *   [[footnote about "Plexy"|readings/kaplan-plexy.pdf]] from Kaplan's *Demonstratives* about Plexy; [[our notes|topics/week6_plexy]] comparing to the Maybe type
120 *   (Recommended) [[King's discussion of Schiffer|readings/king-on-schiffer.pdf]] in Chapter 4 of *The Nature and Structure of Content* (2007)
121 *   (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)" -->
122 *   Michael Rieppel, "[[Being Something: Properties and Predicative Quantification|readings/rieppel-beingsthg.pdf]]"
123
124 Week 7:
125
126 *   [[Combinatory evaluator|topics/week7_combinatory_evaluator]]
127 *   [[Introducing Monads|topics/week7_introducing_monads]] (updated Mon 23 Mar)
128 *   [[Homework for week 7|exercises/assignment7]] (updated Mon 23 Mar)
129 *   [[Environments and Closures|topics/week7_environments_and_closures]]
130 *   [[Untyped lambda evaluator|topics/week7_untyped_evaluator]]
131
132
133 Week 8:
134
135 *   [[Safe division with monads|topics/week8_safe_division_with_monads]]
136