X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=index.mdwn;h=f5dd97128c9baa403b3317eab54cb18a128f0994;hp=8f0e0c6ea756a95be6b19a1b6cdc3f13c6c1029d;hb=5a31469c4ad627adff595c2f024b7e3d711f5f69;hpb=54566d57756ec32f26dd22ec4a8258be7d3c5ebb diff --git a/index.mdwn b/index.mdwn index 8f0e0c6e..f5dd9712 100644 --- a/index.mdwn +++ b/index.mdwn @@ -109,7 +109,7 @@ The [[differences between our made-up language and Scheme, OCaml, and Haskell|ro [[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); +[[Reduction Strategies and Normal Forms|topics/week3_evaluation_order]] (posted on Monday 23 Feb); [[Unit and its usefulness|topics/week3 unit]] (posted on Wednesday); [[Combinatory Logic|topics/week3 combinatory logic]] (revised on Monday and Tuesday); [[Homework|exercises/assignment3]] @@ -123,10 +123,13 @@ Reduction Strategies and Normal Forms (in progress); > Topics: [[!img images/tabletop_roleplaying.png size="240x240" alt="Hey, no recursing"]] [[Yes, recursing|topics/week4_fixed_point_combinators]]; [[More about fixed point combinators|topics/week4_more_about_fixed_point_combinators]]; -Towards types (in progress) +Towards types (in progress); +[[Homework|exercises/assignment4]] > 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 posted [[answers to Week 3's homework|exercises/assignment3_answers]]. +