From: Chris Barker <barker@kappa.(none)>
Date: Sun, 26 Sep 2010 22:05:14 +0000 (-0400)
Subject: edits
X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=0075435e792b4c2ef1b718b695aebd016d2929a4

edits
---

diff --git a/week3.mdwn b/week3.mdwn
index c66526d3..c1804879 100644
--- a/week3.mdwn
+++ b/week3.mdwn
@@ -435,15 +435,15 @@ For those of you who like to watch ultra slow-mo movies of bullets
 piercing apples, here's a stepwise computation of the application of a
 recursive function.  We'll use a function `sink`, which takes one
 argument.  If the argument is boolean true (i.e., `\x y.x`), it
-returns itself (a copy of `sink`); if the argument is boolean false,
-it returns I.  That is, we want the following behavior:
+returns itself (a copy of `sink`); if the argument is boolean false
+(`\x y. y`), it returns `I`.  That is, we want the following behavior:
 
     sink false ~~> I
     sink true false ~~> I
     sink true true false ~~> I
     sink true true true false ~~> I
 
-So we make sink = Y (\f b. b f I): 
+So we make `sink = Y (\f b. b f I)`: 
 
     1. sink false 
     2. Y (\fb.bfI) false