X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?a=blobdiff_plain;f=index.mdwn;h=0c072c85cf0f43e4b3cffea6f1d851d74e8daceb;hb=50395ea8bd3a1d76a12bc9a371b67285c4311d7a;hp=7adc9d5f8476f200464b8488bf9d8746277a719e;hpb=c34fbdb0806c93ae519eddec85bc7777e463b9b3;p=lambda.git diff --git a/index.mdwn b/index.mdwn index 7adc9d5f..0c072c85 100644 --- a/index.mdwn +++ b/index.mdwn @@ -110,12 +110,13 @@ The [[differences between our made-up language and Scheme, OCaml, and Haskell|ro [[More on Lists|topics/week3 lists]] (expanded on Sunday); [[What is computation?|topics/week3_what_is_computation]]; Reduction Strategies and Normal Forms (in progress); -Usefulness of `()` (in progress); -[[Combinatory Logic|topics/week3 combinatory logic]]; +[[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. +> 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]].