+
+
+(**Week 1**) Thursday 29 Jan 2015
+
+> Topics:
+[[Order in programming languages and natural language|topics/week1 order]];
+[[Introduction to functional programming|topics/week1 kapulet intro]];
+[[Homework|exercises/assignment1]];
+[[Advanced notes|topics/week1 kapulet advanced]]
+
+(**Intermezzo**)
+> Help on [[learning Scheme]], [[OCaml|learning OCaml]], and [[Haskell|learning Haskell]];
+The [[differences between our made-up language and Scheme, OCaml, and Haskell|rosetta1]];
+[[What do words like "interpreter" and "compiler" mean?|ecosystem]] (in progress)
+
+(**[[Lambda Evaluator|code/lambda evaluator]]**) Usable in your browser. It can help you check whether your answer to some of the (upcoming) homework questions works correctly.
+<!--
+ There is also now a [library](/lambda library) of lambda-calculus arithmetical and list operations, some relatively advanced.
+-->
+
+(**Week 2**) Thursday 5 February 2015
+> Topics:
+[[Intro to the Lambda Calculus|topics/week2 lambda intro]];
+[[Advanced notes|topics/week2 lambda advanced]];
+[[Encoding Booleans, Tuples, Lists, and Numbers|topics/week2 encodings]];
+[[Homework|exercises/assignment2]]
+
+> Also, if you're reading the Hankin book, try reading Chapters 1-3. You will most likely need to come back again and read it multiple times; but this would be a good time to make the first attempt.
+
+> We posted [[answers to Week 1's homework|exercises/assignment1_answers]].
+
+(**Week 3**) Thursday 12 February 2015
+> Topics:
+More on Lists (in progress);
+Combinatory Logic (in progress);
+Reduction Strategies and Normal Forms (in progress);
+Homework (in progress)
+
+> Also, by this point you should be able to handle all of *The Little Schemer* except for Chapters 9 and 10. Chapter 9 covers what is going on under the hood with `letrec`, and that will be our topic for next week.
+
+
+<!--
+We've added a [[Monad Library]] for OCaml.
+We've posted a [[State Monad Tutorial]].
+-->
+
+