28b122c36f37af0aba470ec77a4af1da431d2c78
1 # Topics #
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 *   Functional Programming
12     *   [[Introduction|topics/week1 kapulet intro]]
14     *   [["Rosetta Stone" page #1 for Kaupulet, Scheme, OCaml, Haskell|rosetta1]]
16     *   [[List Comprehensions|topics/week3 lists#comprehensions]]
17     *   [[Unit and its usefulness|topics/week3 unit]]
18     *   More tips on using Scheme
19     *   Types in OCaml and Haskell (will be posted soon)
20     *   Practical advice for working with OCaml and/or Haskell (will be posted soon)
22 *   Order, "static versus dynamic"
24     *   [[Order in programming languages and natural language|topics/week1 order]]
25     *   [[Reduction Strategies and Normal Forms in the Lambda Calculus|topics/week3_evaluation_order]]
26     *   [[Unit and its usefulness|topics/week3 unit]]
28 *   The Untyped Lambda Calculus
30     *   [[Introduction to the Lambda Calculus|topics/week2 lambda intro]]
32     *   Encoding data types in the Lambda Calculus
33         *   [[Booleans|topics/week2 encodings#booleans]]
34         *   [[Tuples|topics/week2 encodings#tuples]]
35         *   [[Lists|topics/week2 encodings#lists]], v1 (as right-folds)
36         *   [[Numbers|topics/week2 encodings#numbers]], v1 ("Church's encoding")
37         *   [[Arithmetic with Church numbers|topics/week3_church_arithmetic]]
38         *   [[How to get the `tail` of v1 lists?|topics/week3 lists#tails]]
39         *   [[Some other list encodings|topics/week3 lists#other-lists]]
40     *   [[Reduction Strategies and Normal Forms|topics/week3_evaluation_order]]
41     *   [[Fixed point combinators|topics/week4_fixed_point_combinators]]
44 *   [[Combinatory Logic|topics/week3 combinatory logic]]
46 *   Typed Lambda Calculi
48     *   [[Simply-typed lambda calculus|topics/week5 simply typed]] (will be updated)
49     *   [[System F|topics/week5 system F]] (will be updated)
50     *   Types in OCaml and Haskell (will be posted soon)
53 ## Topics by week ##
55 Week 1:
57 *   [[Order in programming languages and natural language|topics/week1 order]]
58 This discussion considers conjunction in a language that recognized presupposition failure.
59 *   [[Introduction to functional programming|topics/week1 kapulet intro]]
60 Basics of functional programming: `let`, `case`, pattern matching, and
61 recursion.  Definitions of factorial.
65 Week 2:
67 *   [[Introduction to the Lambda Calculus|topics/week2 lambda intro]]
69 *   [[Encoding Booleans, Tuples, Lists, and Numbers|topics/week2 encodings]]
72 Week 3:
74 *These notes were developed over the course of the week. It'd be a good idea to review them again now, to be sure you've read all the content.*
76 *   [[Arithmetic with Church numbers|topics/week3_church_arithmetic]]
77 *   [[More on Lists|topics/week3 lists]]
78 Introduces list comprehensions, discusses how to get the `tail` of lists in the Lambda Calculus, and some new list encodings
79 *   [[What is computation?|topics/week3_what_is_computation]]
80 *   [[Reduction Strategies and Normal Forms|topics/week3_evaluation_order]] (posted on Monday 23 Feb)
81 *   [[Unit and its usefulness|topics/week3 unit]]
82 *   [[Combinatory Logic|topics/week3 combinatory logic]]