X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=index.mdwn;h=b352d58b8686010b3d6dec76e970f8df67e5f823;hp=f1d8aaadbbc1d3fefb3c614b367cb6800d2e121e;hb=69cefc9d2ec23b63ee6ae14d6b0c2b0ddabfd68e;hpb=0f8503747fc777486c8bfa7a06a5e9884ce2389d diff --git a/index.mdwn b/index.mdwn index f1d8aaad..b352d58b 100644 --- a/index.mdwn +++ b/index.mdwn @@ -106,16 +106,31 @@ 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); +[[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]] +> 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]]. + +(**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]].