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]]
13     *   [[Week 1 Advanced notes|topics/week1 kapulet advanced]]
14     *   [["Rosetta Stone" page #1 for Kaupulet, Scheme, OCaml, Haskell|rosetta1]]
15     *   Offsite links for help on [[learning Scheme]], [[OCaml|learning OCaml]], and [[Haskell|learning Haskell]]
16     *   [[List Comprehensions|topics/week3 lists#comprehensions]]
17     *   [[Unit and its usefulness|topics/week3 unit]]
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]]
29     *   [[Advanced notes on the Lambda Calculus|topics/week2 lambda advanced]]
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         *   [[Arithmetic with Church numbers|topics/week3_church_arithmetic]]
36         *   [[How to get the `tail` of v1 lists?|topics/week3 lists#tails]]
37         *   [[Some other list encodings|topics/week3 lists#other-lists]]
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.
53 *   [[Advanced notes on functional programming|topics/week1 kapulet advanced]]
54 *   [[Homework for week 1|exercises/assignment1]] ([[Answers|exercises/assignment1_answers]])
56 Week 2:
58 *   [[Introduction to the Lambda Calculus|topics/week2 lambda intro]]
59 *   [[Advanced notes on the Lambda Calculus|topics/week2 lambda advanced]]
60 *   [[Encoding Booleans, Tuples, Lists, and Numbers|topics/week2 encodings]]
61 *   [[Homework for week 2|exercises/assignment2]] ([[Answers|exercises/assignment2_answers]])
63 Week 3:
65 *We will continue to develop these notes over the next few days. Expect some of the notes already posted to be expanded, and more notes to appear.*
67 *   [[Arithmetic with Church numbers|topics/week3_church_arithmetic]]
68 *   [[More on Lists|topics/week3 lists]] (expanded on Sunday)
69 Introduces list comprehensions, discusses how to get the `tail` of lists in the Lambda Calculus, and some new list encodings
70 *   [[What is computation?|topics/week3_what_is_computation]]
71 *   Reduction Strategies and Normal Forms
72 *   [[Unit and its usefulness|topics/week3 unit]] (posted on Wednesday)
73 *   [[Combinatory Logic|topics/week3 combinatory logic]] (revised on Monday and Tuesday)
74 *   [[Homework for week 3|exercises/assignment3]]