From 0da178367cda4feaf08df9a101b7d36eedee9f58 Mon Sep 17 00:00:00 2001 From: jim Date: Tue, 17 Feb 2015 23:23:03 -0500 Subject: [PATCH] post Hankin Chapter 4 reading, answers to homework 2 --- index.mdwn | 5 +++-- 1 file changed, 3 insertions(+), 2 deletions(-) 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]].