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