X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=lambda_evaluator.mdwn;h=df28a423aa267c457689c623c9bf9901324e13b1;hp=4cf073616c23eca99b37672019949d79b5b93dfc;hb=a995e882b81ec3f1940906fdb6b2118f4b8c6c66;hpb=08e5cbb580b637a3e4c92fbb4fbb9f7891b81103;ds=sidebyside

diff --git a/lambda_evaluator.mdwn b/lambda_evaluator.mdwn
index 4cf07361..df28a423 100644
--- a/lambda_evaluator.mdwn
+++ b/lambda_evaluator.mdwn
@@ -6,7 +6,7 @@ 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.  
+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)`.
 
 *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,