a71f620d2fa06fe15ba134c92ec49181466db78d
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     *   Usefulness of `()`
18     *   More tips on using Scheme
20 *   Order, "static versus dynamic"
22     *    [[Order in programming languages and natural language|topics/week1 order]]
23     *    Reduction Strategies and Normal Forms in the Lambda Calculus
24     *   Usefulness of `()`
26 *   The Lambda Calculus
28     *   [[Introduction to the Lambda Calculus|topics/week2 lambda intro]]
30     *   Encoding data types in the Lambda Calculus
31         *   [[Booleans|topics/week2 encodings#booleans]]
32         *   [[Tuples|topics/week2 encodings#tuples]]
33         *   [[Lists|topics/week2 encodings#lists]], v1 (as right-folds)
34         *   [[Numbers|topics/week2 encodings#numbers]], v1 ("Church's encoding")
35         *   [[How to get the `tail` of v1 lists?|topics/week3 lists#tails]]
36         *   Some other list encodings
37         *   Arithmetic with Church numbers
38     *    Reduction Strategies and Normal Forms
41 *    [[Combinatory Logic|topics/week3 combinatory logic]]
44 ## Topics by week ##
46 Week 1:
48 *   [[Order in programming languages and natural language|topics/week1 order]]
49 This discussion considers conjunction in a language that recognized presupposition failure.
50 *   [[Introduction to functional programming|topics/week1 kapulet intro]]
51 Basics of functional programming: `let`, `case`, pattern matching, and
52 recursion.  Definitions of factorial.
56 Week 2:
58 *   [[Introduction to the Lambda Calculus|topics/week2 lambda intro]]