3 These topics are organized in two ways: by their content, and by the
4 week in which they were introduced.
6 ## Topics by content ##
8 * [[What is computation?|topics/week3_what_is_computation]]
10 * [[Kaplan on Plexy|topics/week6_plexy]]
12 * Functional Programming
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
25 * [[Introducing Monads|topics/week7_introducing_monads]]
27 * Order, "static versus dynamic"
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|topics/week7_combinatory_evaluator]]
34 * The Untyped Lambda Calculus
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 * Interpreter for Lambda terms
53 * [[Introduction|topics/week3 combinatory logic]]
54 * [[Combinatory evaluator|topics/week7_combinatory_evaluator]]
56 * Typed Lambda Calculi
58 * [[Simply-typed lambda calculus|topics/week5 simply typed]] (will be updated)
59 * [[System F|topics/week5 system F]] (will be updated)
60 * Types in OCaml and Haskell (will be posted someday)
61 * [[Introducing Monads|topics/week7_introducing_monads]]
68 * [[Order in programming languages and natural language|topics/week1 order]]
69 This discussion considers conjunction in a language that recognized presupposition failure.
70 * [[Introduction to functional programming|topics/week1 kapulet intro]]
71 Basics of functional programming: `let`, `case`, pattern matching, and
72 recursion. Definitions of factorial.
73 * [[Advanced notes on functional programming|topics/week1 kapulet advanced]]
74 * [[Homework for week 1|exercises/assignment1]] ([[Answers|exercises/assignment1_answers]])
78 * [[Introduction to the Lambda Calculus|topics/week2 lambda intro]]
79 * [[Advanced notes on the Lambda Calculus|topics/week2 lambda advanced]]
80 * [[Encoding Booleans, Tuples, Lists, and Numbers|topics/week2 encodings]]
81 * [[Homework for week 2|exercises/assignment2]] ([[Answers|exercises/assignment2_answers]])
85 * [[Arithmetic with Church numbers|topics/week3_church_arithmetic]]
86 * [[More on Lists|topics/week3 lists]]
87 Introduces list comprehensions, discusses how to get the `tail` of lists in the Lambda Calculus, and some new list encodings
88 * [[What is computation?|topics/week3_what_is_computation]]
89 * [[Reduction Strategies and Normal Forms|topics/week3_evaluation_order]] (posted on Monday 23 Feb)
90 * [[Unit and its usefulness|topics/week3 unit]]
91 * [[Combinatory Logic|topics/week3 combinatory logic]]
92 * [[Homework for week 3|exercises/assignment3]] ([[Answers|exercises/assignment3_answers]])
96 * [[Fixed point combinators|topics/week4_fixed_point_combinators]]
97 * [[More about fixed point combinators|topics/week4_more_about_fixed_point_combinators]]
98 * Towards types (in progress)
99 * [[Homework for week 4|exercises/assignment4]] ([[Answers|exercises/assignment4_answers]])
103 * [[Simply-typed lambda calculus|topics/week5 simply typed]]
104 * [[System F|topics/week5 system F]]
105 * Types in OCaml and Haskell (will be posted someday)
106 * Practical advice for working with OCaml and/or Haskell (will be posted someday)
107 * [[Homework for weeks 5 and 6|exercises/assignment5]] ([[Answers|exercises/assignment5_answers]])
112 * [[footnote about "Plexy"|readings/kaplan-plexy.pdf]] from Kaplan's *Demonstratives* about Plexy; [[our notes|topics/week6_plexy]] comparing to the Maybe type
113 * (Recommended) [[King's discussion of Schiffer|readings/king-on-schiffer.pdf]] in Chapter 4 of *The Nature and Structure of Content* (2007)
114 * (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)" -->
115 * Michael Rieppel, "[[Being Something: Properties and Predicative Quantification|readings/rieppel-beingsthg.pdf]]"
119 * [[Combinatory evaluator|topics/week7_combinatory_evaluator]]
120 * Lambda evaluator (will be posted soon)
121 * [[Introducing Monads|topics/week7_introducing_monads]] (updated Fri 20 Mar)
122 * [[Homework for week 7|exercises/assignment7]]