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|topics/week3_evaluation_order]]
24 * [[Unit and its usefulness|topics/week3 unit]]
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|topics/week3_evaluation_order]]
39 * [[Fixed point combinators|topics/week4_fixed_point_combinators]]
40 * [[More about fixed point combinators|topics/week4_more_about_fixed_point_combinators]]
43 * [[Combinatory Logic|topics/week3 combinatory logic]]
50 * [[Order in programming languages and natural language|topics/week1 order]]
51 This discussion considers conjunction in a language that recognized presupposition failure.
52 * [[Introduction to functional programming|topics/week1 kapulet intro]]
53 Basics of functional programming: `let`, `case`, pattern matching, and
54 recursion. Definitions of factorial.
55 * [[Advanced notes on functional programming|topics/week1 kapulet advanced]]
56 * [[Homework for week 1|exercises/assignment1]] ([[Answers|exercises/assignment1_answers]])
60 * [[Introduction to the Lambda Calculus|topics/week2 lambda intro]]
61 * [[Advanced notes on the Lambda Calculus|topics/week2 lambda advanced]]
62 * [[Encoding Booleans, Tuples, Lists, and Numbers|topics/week2 encodings]]
63 * [[Homework for week 2|exercises/assignment2]] ([[Answers|exercises/assignment2_answers]])
67 *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.*
69 * [[Arithmetic with Church numbers|topics/week3_church_arithmetic]]
70 * [[More on Lists|topics/week3 lists]]
71 Introduces list comprehensions, discusses how to get the `tail` of lists in the Lambda Calculus, and some new list encodings
72 * [[What is computation?|topics/week3_what_is_computation]]
73 * [[Reduction Strategies and Normal Forms|topics/week3_evaluation_order]] (posted on Monday 23 Feb)
74 * [[Unit and its usefulness|topics/week3 unit]]
75 * [[Combinatory Logic|topics/week3 combinatory logic]]
76 * [[Homework for week 3|exercises/assignment3]] ([[Answers|exercises/assignment3_answers]])
80 * [[Fixed point combinators|topics/week4_fixed_point_combinators]]
81 * [[More about fixed point combinators|topics/week4_more_about_fixed_point_combinators]]
82 * Towards types (in progress)
83 * [[Homework for week 4|exercises/assignment4]]