## Topics by content ##
+* [[What is computation?|topics/week3_what_is_computation]]
+
* Functional Programming
* [[Introduction|topics/week1 kapulet intro]]
* [[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]]
* Order, "static versus dynamic"
* [[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]]
* Reduction Strategies and Normal Forms
-* Combinatorial Logic
+* [[Combinatory Logic|topics/week3 combinatory logic]]
## Topics by week ##
Basics of functional programming: `let`, `case`, pattern matching, and
recursion. Definitions of factorial.
* [[Advanced notes on functional programming|topics/week1 kapulet advanced]]
-* [[Homework for week 1|exercises/assignment1]]
+* [[Homework for week 1|exercises/assignment1]] ([[Answers|exercises/assignment1_answers]])
Week 2:
Week 3:
-* More on Lists
+* [[What is computation?|topics/week3_what_is_computation]]
+* [[More on Lists|topics/week3 lists]]
Introduces list comprehensions, discusses how to get the `tail` of lists in the Lambda Calculus
-* Combinatorial Logic
+* [[Combinatory Logic|topics/week3 combinatory logic]]
* Reduction Strategies and Normal Forms
* Homework for week 3