X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=index.mdwn;h=039035011f99d9f0ebe7592903e3c6b9c818ea5d;hp=af593b66bb29433883c4fad89a443edae8450a90;hb=1c616d1aeb687348c467d78b8149d5b415be2328;hpb=cdd2eadc0a38d4d42cf19648f3cb0f6fb8ff9995 diff --git a/index.mdwn b/index.mdwn index af593b66..03903501 100644 --- a/index.mdwn +++ b/index.mdwn @@ -103,14 +103,20 @@ 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: -More on Lists (in progress); -Combinatory Logic (in progress); +[[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); -Homework (in progress) +Usefulness of `()` (in progress); +[[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]].