X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=index.mdwn;h=039035011f99d9f0ebe7592903e3c6b9c818ea5d;hp=f1d8aaadbbc1d3fefb3c614b367cb6800d2e121e;hb=010e2ff488d153fbf691ab5f5e42190d176e0d04;hpb=0f8503747fc777486c8bfa7a06a5e9884ce2389d diff --git a/index.mdwn b/index.mdwn index f1d8aaad..03903501 100644 --- a/index.mdwn +++ b/index.mdwn @@ -106,17 +106,17 @@ The [[differences between our made-up language and Scheme, OCaml, and Haskell|ro *We will continue to develop these notes over the next few days.* > Topics: -Arithmetic with Church numbers (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]]; -[[More on Lists|topics/week3 lists]] (will be expanded); -[[Combinatory Logic|topics/week3 combinatory logic]]; Reduction Strategies and Normal Forms (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. You can also read Chapter 4 of Hankin on Combinatory Logic. -> 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. - +> We posted [[answers to Week 2's homework|exercises/assignment2_answers]].