* [["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|topics/week3 lists#comprehensions]]
- * Usefulness of `()`
+ * [[Unit and its usefulness|topics/week3 unit]]
* More tips on using Scheme
* Order, "static versus dynamic"
* [[Introduction to the Lambda Calculus|topics/week2 lambda intro]]
* [[Advanced notes on the Lambda Calculus|topics/week2 lambda advanced]]
* [[Encoding Booleans, Tuples, Lists, and Numbers|topics/week2 encodings]]
-* [[Homework for week 2|exercises/assignment2]]
+* [[Homework for week 2|exercises/assignment2]] ([[Answers|exercises/assignment2_answers]])
Week 3:
Introduces list comprehensions, discusses how to get the `tail` of lists in the Lambda Calculus, and some new list encodings
* [[What is computation?|topics/week3_what_is_computation]]
* Reduction Strategies and Normal Forms
-* Usefulness of `()`
-* [[Combinatory Logic|topics/week3 combinatory logic]]
+* [[Unit and its usefulness|topics/week3 unit]] (posted on Wednesday)
+* [[Combinatory Logic|topics/week3 combinatory logic]] (revised on Monday and Tuesday)
* [[Homework for week 3|exercises/assignment3]]