name change
[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 *   [[Groenendijk, Stokhof, and Veltman|/topics/week10_gsv]]
12 *   Mutation and hyper-synonymy (no notes)
13
14
15 *   Functional Programming
16
17     *   [[Introduction|topics/week1 kapulet intro]]
18     *   [[Week 1 Advanced notes|topics/week1 kapulet advanced]]
19     *   [["Rosetta Stone" page #1 for Kaupulet, Scheme, OCaml, Haskell|rosetta1]]
20     *   Offsite links for help on [[learning Scheme]], [[OCaml|learning OCaml]], and [[Haskell|learning Haskell]]
21     *   [[List Comprehensions|topics/week3 lists#comprehensions]]
22     *   [[Unit and its usefulness|topics/week3 unit]]
23     *   More tips on using Scheme
24     *   Types in OCaml and Haskell (will be posted someday)
25     *   Practical advice for working with OCaml and/or Haskell (will be posted someday)
26     *   [[Kaplan on Plexy|topics/week6_plexy]] and the Maybe type
27     *   Untyped lambda evaluator ([[in browser|code/lambda_evaluator]]) ([[for home|topics/week7_untyped_evaluator]])
28     *   [[Ramble on Monads and Modules|topics/week8_monads_and_modules]]
29     *   [[Installing and Using the Juli8 Libraries|/juli8]]
30     *   [[Programming with mutable state|/topics/week9_mutable_state]]
31     *   Mutation and hyper-synonymy (no notes)
32
33
34 *   Order, "static versus dynamic"
35
36     *   [[Order in programming languages and natural language|topics/week1 order]]
37     *   [[Reduction Strategies and Normal Forms in the Lambda Calculus|topics/week3_evaluation_order]]
38     *   [[Unit and its usefulness|topics/week3 unit]]
39     *   Combinatory evaluator ([[for home|topics/week7_combinatory_evaluator]])
40     *   [[Programming with mutable state|/topics/week9_mutable_state]]
41     *   see also Continuation links, below
42
43
44 *   The Untyped Lambda Calculus
45
46     *   [[Introduction to the Lambda Calculus|topics/week2 lambda intro]]
47     *   [[Advanced notes on the Lambda Calculus|topics/week2 lambda advanced]]
48     *   Encoding data types in the Lambda Calculus
49         *   [[Booleans|topics/week2 encodings#booleans]]
50         *   [[Tuples|topics/week2 encodings#tuples]]
51         *   [[Lists|topics/week2 encodings#lists]], v1 (as right-folds)
52         *   [[Numbers|topics/week2 encodings#numbers]], v1 ("Church's encoding")
53         *   [[Arithmetic with Church numbers|topics/week3_church_arithmetic]]
54         *   [[How to get the `tail` of v1 lists?|topics/week3 lists#tails]]
55         *   [[Some other list encodings|topics/week3 lists#other-lists]]
56         *   [[Abortable list traversals|/topics/week12_abortable_traversals]]
57     *   [[Reduction Strategies and Normal Forms|topics/week3_evaluation_order]]
58     *   [[Fixed point combinators|topics/week4_fixed_point_combinators]]
59     *   [[More about fixed point combinators|topics/week4_more_about_fixed_point_combinators]]
60     *   Untyped lambda evaluator ([[in browser|code/lambda_evaluator]]) ([[for home|topics/week7_untyped_evaluator]])
61     *   [[Environments and Closures|topics/week7_environments_and_closures]]
62
63
64 *   Combinatory logic
65
66     *   [[Introduction|topics/week3 combinatory logic]]
67     *   Combinatory evaluator ([[for home|topics/week7_combinatory_evaluator]])
68
69 *   Typed Lambda Calculi
70
71     *   [[Simply-typed lambda calculus|topics/week5 simply typed]] (will be updated)
72     *   [[System F|topics/week5 system F]] (will be updated)
73     *   Types in OCaml and Haskell (will be posted someday)
74     *   see also Monads links, below
75
76 *   Monads
77     *   [[Introducing Monads|topics/week7_introducing_monads]]
78     *   [[Safe division with monads|topics/week8_safe_division_with_monads]]
79     *   [[Reader Monad|/topics/week8_reader_monad]]
80     *   [[Ramble on Monads and Modules|topics/week8_monads_and_modules]]
81     *   [[Using the OCaml Monad library|/topics/week9_using_the_monad_library]]
82     *   [[Programming with mutable state|/topics/week9_mutable_state]]
83     *   [[A State Monad Tutorial|/topics/week9_state_monad_tutorial]]
84     *   [[Using multiple monads together|/topics/week9_monad_transformers]]
85     *   [[Groenendijk, Stokhof, and Veltman|/topics/week10_gsv]]
86
87
88 *   Continuations
89     *   [[Abortable list traversals|/topics/week12_abortable_traversals]]
90     *   [[List and tree zippers|/topics/week12_list_and_tree_zippers]]
91     *   [[From list zippers to continuations|topics/week13_from_list_zippers_to_continuations]]
92     *   [[Coroutines, exceptions, and aborts|topics/week13_coroutines_exceptions_and_aborts]]
93     *   [[Let/cc and reset/shift|topics/week13_native_continuation_operators]]
94     *   CPS transforms
95
96
97
98 ## Topics by week ##
99
100 Week 1:
101
102 *   [[Order in programming languages and natural language|topics/week1 order]]
103 This discussion considers conjunction in a language that recognized presupposition failure.
104 *   [[Introduction to functional programming|topics/week1 kapulet intro]]
105 Basics of functional programming: `let`, `case`, pattern matching, and
106 recursion.  Definitions of factorial.
107 *   [[Advanced notes on functional programming|topics/week1 kapulet advanced]]
108 *   [[Homework for week 1|exercises/assignment1]] ([[Answers|exercises/assignment1_answers]])
109
110 Week 2:
111
112 *   [[Introduction to the Lambda Calculus|topics/week2 lambda intro]]
113 *   [[Advanced notes on the Lambda Calculus|topics/week2 lambda advanced]]
114 *   [[Encoding Booleans, Tuples, Lists, and Numbers|topics/week2 encodings]]
115 *   [[Homework for week 2|exercises/assignment2]] ([[Answers|exercises/assignment2_answers]])
116
117 Week 3:
118
119 *   [[Arithmetic with Church numbers|topics/week3_church_arithmetic]]
120 *   [[More on Lists|topics/week3 lists]]
121 Introduces list comprehensions, discusses how to get the `tail` of lists in the Lambda Calculus, and some new list encodings
122 *   [[What is computation?|topics/week3_what_is_computation]]
123 *   [[Reduction Strategies and Normal Forms|topics/week3_evaluation_order]] (posted on Monday 23 Feb)
124 *   [[Unit and its usefulness|topics/week3 unit]]
125 *   [[Combinatory Logic|topics/week3 combinatory logic]]
126 *   [[Homework for week 3|exercises/assignment3]] ([[Answers|exercises/assignment3_answers]])
127
128 Week 4:
129
130 *   [[Fixed point combinators|topics/week4_fixed_point_combinators]]
131 *   [[More about fixed point combinators|topics/week4_more_about_fixed_point_combinators]]
132 *   Towards types (in progress)
133 *   [[Homework for week 4|exercises/assignment4]] ([[Answers|exercises/assignment4_answers]])
134
135 Week 5:
136
137 *   [[Simply-typed lambda calculus|topics/week5 simply typed]]
138 *   [[System F|topics/week5 system F]]
139 *   Types in OCaml and Haskell (will be posted someday)
140 *   Practical advice for working with OCaml and/or Haskell (will be posted someday)
141 *   [[Homework for weeks 5 and 6|exercises/assignment5-6]] ([[Answers|exercises/assignment5-6_answers]])
142
143
144 Week 6:
145
146 *   [[footnote about "Plexy"|readings/kaplan-plexy.pdf]] from Kaplan's *Demonstratives* about Plexy; [[our notes|topics/week6_plexy]] comparing to the Maybe type
147 *   (Recommended) [[King's discussion of Schiffer|readings/king-on-schiffer.pdf]] in Chapter 4 of *The Nature and Structure of Content* (2007)
148 *   (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)" -->
149 *   Michael Rieppel, "[[Being Something: Properties and Predicative Quantification|readings/rieppel-beingsthg.pdf]]"
150
151 Week 7:
152
153 *   [[Combinatory evaluator|topics/week7_combinatory_evaluator]]
154 *   [[Introducing Monads|topics/week7_introducing_monads]] (updated Mon 23 Mar)
155 *   [[Homework for week 7|exercises/assignment7]] (updated Mon 23 Mar)
156 *   [[Environments and Closures|topics/week7_environments_and_closures]]
157 *   [[Untyped lambda evaluator|topics/week7_untyped_evaluator]]
158
159
160 Week 8:
161
162 *   [[Safe division with monads|topics/week8_safe_division_with_monads]]
163 *   [[Reader Monad|/topics/week8_reader_monad]]
164 *   [[Ramble on Monads and Modules|topics/week8_monads_and_modules]]
165
166 Week 9:
167
168 *   [[Installing and Using the Juli8 Libraries|/juli8]]
169 *   [[Using the OCaml Monad library|/topics/week9_using_the_monad_library]]
170 *   [[Programming with mutable state|/topics/week9_mutable_state]]
171 *   [[A State Monad Tutorial|/topics/week9_state_monad_tutorial]]
172 *   [[Using multiple monads together|/topics/week9_monad_transformers]]
173 *   [[Homework for weeks 8-9|/exercises/assignment8-9]]
174
175 Week 10:
176
177 *   Groenendijk, Stokhof, and Veltman, "[[Coreference and Modality|/readings/coreference-and-modality.pdf]]" (1996)
178 *   [[Notes on GSV|/topics/week10_gsv]], with links to code
179
180
181 Week 12:
182
183 *   Mutation and hyper-synonymy (no notes)
184 *   [[Abortable list traversals|/topics/week12_abortable_traversals]]
185 *   [[List and tree zippers|/topics/week12_list_and_tree_zippers]]
186 *   [[Homework for week 12|exercises/assignment12]]
187
188 Week 13:
189
190 *   [[From list zippers to continuations|topics/week13_from_list_zippers_to_continuations]]
191 *   [[Coroutines, exceptions, and aborts|topics/week13_coroutines_exceptions_and_aborts]]
192 *   [[Let/cc and reset/shift|topics/week13_native_continuation_operators]]
193 *   CPS transforms