* [[Week 1 Advanced notes|topics/week1 kapulet advanced]]
* [["Rosetta Stone" page #1 for Kaupulet, Scheme, OCaml, Haskell|rosetta1]]
* Offsite links for help on [[learning Scheme]], [[OCaml|learning OCaml]], and [[Haskell|learning Haskell]]
- * List Comprehensions
+ * [[List Comprehensions|topics/week3 lists#comprehensions]]
+ * Usefulness of `()`
+ * More tips on using Scheme
* Order, "static versus dynamic"
* [[Order in programming languages and natural language|topics/week1 order]]
* Reduction Strategies and Normal Forms in the Lambda Calculus
+ * Usefulness of `()`
* The Lambda Calculus
* [[Tuples|topics/week2 encodings#tuples]]
* [[Lists|topics/week2 encodings#lists]], v1 (as right-folds)
* [[Numbers|topics/week2 encodings#numbers]], v1 ("Church's encoding")
- * How to get the `tail` of v1 lists?
+ * [[How to get the `tail` of v1 lists?|topics/week3 lists#tails]]
+ * Some other list encodings
+ * Arithmetic with Church numbers
* Reduction Strategies and Normal Forms
* [[Encoding Booleans, Tuples, Lists, and Numbers|topics/week2 encodings]]
* [[Homework for week 2|exercises/assignment2]]
-Week 3:But even deci
+Week 3:
+*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.*
+
+* Arithmetic with Church numbers
* [[What is computation?|topics/week3_what_is_computation]]
-* More on Lists
-Introduces list comprehensions, discusses how to get the `tail` of lists in the Lambda Calculus
+* [[More on Lists|topics/week3 lists]]
+Introduces list comprehensions, discusses how to get the `tail` of lists in the Lambda Calculus (and will discuss some other list encodings)
* [[Combinatory Logic|topics/week3 combinatory logic]]
* Reduction Strategies and Normal Forms
-* Homework for week 3
-
-
-
-*More coming, please wait...*
+* Usefulness of `()`
+* [[Homework for week 3|exercises/assignment3]]