X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=index.mdwn;h=b352d58b8686010b3d6dec76e970f8df67e5f823;hp=0c072c85cf0f43e4b3cffea6f1d851d74e8daceb;hb=c98d4e2d9d0c85b16ac707323031114f2a3db1aa;hpb=49bee29e4cf916d3d8e5ac581bf1d1a3dd00f3f8 diff --git a/index.mdwn b/index.mdwn index 0c072c85..b352d58b 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]] @@ -118,6 +118,21 @@ Reduction Strategies and Normal Forms (in progress); > 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 about fixed point combinators|topics/week4_more_about_fixed_point_combinators]]; +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. + +> If you're reading along in the Pierce book, we've now covered much of the material in his Chapters 1-7. + +> We posted [[answers to Week 3's homework|exercises/assignment3_answers]]. + +