From: Chris Barker <barker@kappa.linguistics.fas.nyu.edu>
Date: Mon, 27 Sep 2010 17:54:23 +0000 (-0400)
Subject: edits
X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=a26ccd202e5952976a077e3802c176ff477cd225

edits
---

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: