(no commit message)

[lambda.git] / lambda_evaluator.mdwn

diff --git a/lambda_evaluator.mdwn b/lambda_evaluator.mdwn
index 4cf0736..df28a42 100644 (file)
--- 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)`.  
 (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,
 
 *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,