push (old version of) q&a on fixed points

[lambda.git] / index.mdwn

diff --git a/index.mdwn b/index.mdwn
index 7b39b98..73f77f2 100644 (file)
--- a/index.mdwn
+++ b/index.mdwn
@@ -14,6 +14,8 @@ One student session to discuss homeworks will be held every Wednesday from 5-6,
 
 ## Announcements ##
 
+*   [[Untyped lambda calculus evaluator|code/lambda_evaluator]] on this site
+
 *   This wiki will be undergoing lots of changes throughout the semester, and particularly in these first few days as we get it set up, migrate over some of the content from the previous time
 we taught this course, and iron out various technical wrinkles. Please be patient. When you sit down to read the wiki, it's a good idea to always hit "Refresh" in your browser to make sure you're reading the latest additions and refinements of the website. (Sometimes these will be tweaks, other times very substantial. Updates will happen at miscellaneous hours, sometimes many times in a given day.)
 
@@ -100,6 +102,32 @@ The [[differences between our made-up language and Scheme, OCaml, and Haskell|ro
 
 > We posted [[answers to Week 1's homework|exercises/assignment1_answers]].
 
+(**Week 3**) Thursday 12 February 2015
+*We will continue to develop these notes over the next few days.*
+
+> Topics:
+[[Arithmetic with Church numbers|topics/week3_church_arithmetic]];
+[[More on Lists|topics/week3 lists]] (expanded on Sunday);
+[[What is computation?|topics/week3_what_is_computation]];
+Reduction Strategies and Normal Forms (in progress);
+[[Unit and its usefulness|topics/week3 unit]] (posted on Wednesday);
+[[Combinatory Logic|topics/week3 combinatory logic]] (revised on Monday and Tuesday);
+[[Homework|exercises/assignment3]]
+
+> 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. You can also read Chapter 4 of Hankin on Combinatory Logic.
+
+> We posted [[answers to Week 2's homework|exercises/assignment2_answers]].
+
+(**Week 4**) Thursday 19 February 2015
+
+> Topics: [[!img images/tabletop_roleplaying.png size="240x240" alt="Hey, no recursing"]]
+[[Yes, recursing|topics/week4_fixed_point_combinators]];
+More on fixed point combinators (in progress);
+Towards types (in progress)
+
+> Now you can read Sections 3.1 and 6.1 of Hankin; and browse the rest of Hankin Chapter 6, which should look somewhat familiar.
+
+
 <!--
 We've added a [[Monad Library]] for OCaml.
 We've posted a [[State Monad Tutorial]].