From: barker <barker@web>
Date: Tue, 21 Sep 2010 00:40:35 +0000 (-0400)
Subject: (no commit message)
X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=95e1d6e5ad4b98f8f8b359fb0033c913086f98d3

---

diff --git a/lambda_evaluator.mdwn b/lambda_evaluator.mdwn
index df28a423..16eace75 100644
--- a/lambda_evaluator.mdwn
+++ b/lambda_evaluator.mdwn
@@ -6,13 +6,16 @@ It will allow you to write lambda terms and evaluate them, with full ability to
 (This won't work in Racket, because Racket doesn't even try to represent the internal structure of a function in a human-readable way.)  
 
 *Lambda terms*: lambda terms are written with a backslash, thus: `((\x (\y x)) z)`.  
-If you click "Reduce", the system will produce a lambda term that is guaranteed to be reduction equivalent (`<~~>`) with the original term.  So `((\x (\y x)) z)` reduces to `(\y z)`.
+If you click "Reduce", the system will produce a lambda term that is guaranteed to be reduction equivalent (`<~~>`) with the original term.  So `((\x (\y x)) z)` reduces to (a lambda term equivalent to) `(\y z)`.
 
 *Let*: in order to make building a more elaborate system easier, it is possible to define values using `let`.
 In this toy system, `let`s should only be used at the beginning of a file.  If we have, for intance,
 
     let true = (\x (\y x)) in
     let false = (\x (\y y)) in
+    ((true true) false)
+
+the result is `true`.
 
 *Comments*: