* [["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]]
* [["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]]
* More tips on using Scheme
* Order, "static versus dynamic"
* More tips on using Scheme
* Order, "static versus dynamic"
* [[How to get the `tail` of v1 lists?|topics/week3 lists#tails]]
* [[Some other list encodings|topics/week3 lists#other-lists]]
* Reduction Strategies and Normal Forms
* [[How to get the `tail` of v1 lists?|topics/week3 lists#tails]]
* [[Some other list encodings|topics/week3 lists#other-lists]]
* Reduction Strategies and Normal Forms
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]]
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]] (revised on Monday and Tuesday)
+* Reduction Strategies and Normal Forms (will try to post soon)
+* [[Unit and its usefulness|topics/week3 unit]]
+* [[Combinatory Logic|topics/week3 combinatory logic]]