From 3e815ed82351799f955e128da4f9f7755ff7d570 Mon Sep 17 00:00:00 2001 From: barker Date: Mon, 20 Sep 2010 20:49:57 -0400 Subject: [PATCH] --- lambda_evaluator.mdwn | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/lambda_evaluator.mdwn b/lambda_evaluator.mdwn index 7228fca7..61961270 100644 --- a/lambda_evaluator.mdwn +++ b/lambda_evaluator.mdwn @@ -8,7 +8,7 @@ It will allow you to write lambda terms and evaluate them, with full ability to *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 (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`. +*Let*: in order to make building a more elaborate set of terms 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 -- 2.11.0