From a26ccd202e5952976a077e3802c176ff477cd225 Mon Sep 17 00:00:00 2001 From: Chris Barker Date: Mon, 27 Sep 2010 13:54:23 -0400 Subject: [PATCH] edits --- week3.mdwn | 9 +++++++++ 1 file changed, 9 insertions(+) diff --git a/week3.mdwn b/week3.mdwn index e8a86e90..15af3e5b 100644 --- a/week3.mdwn +++ b/week3.mdwn @@ -1,3 +1,12 @@ +[[!toc]] + +##More on evaluation strategies## + +Here are notes on [evaluation order] that make the choice of which +lambda to reduce next the selection of a route through a network of +links. + + ##Computing the length of a list## How could we compute the length of a list? Without worrying yet about what lambda-calculus implementation we're using for the list, the basic idea would be to define this recursively: -- 2.11.0