From 95e1d6e5ad4b98f8f8b359fb0033c913086f98d3 Mon Sep 17 00:00:00 2001
From: barker
Date: Mon, 20 Sep 2010 20:40:35 -0400
Subject: [PATCH]
---
lambda_evaluator.mdwn | 5 ++++-
1 file changed, 4 insertions(+), 1 deletion(-)
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*:
--
2.11.0