X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=index.mdwn;h=039035011f99d9f0ebe7592903e3c6b9c818ea5d;hp=7adc9d5f8476f200464b8488bf9d8746277a719e;hb=4bef10ffc0c1fa2fbc91b24c2b360aa679d77e89;hpb=c34fbdb0806c93ae519eddec85bc7777e463b9b3 diff --git a/index.mdwn b/index.mdwn index 7adc9d5f..03903501 100644 --- a/index.mdwn +++ b/index.mdwn @@ -111,11 +111,12 @@ The [[differences between our made-up language and Scheme, OCaml, and Haskell|ro [[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]]; +[[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]].