tweak lambda evaluator

[lambda.git] / lambda_evaluator.mdwn

diff --git a/lambda_evaluator.mdwn b/lambda_evaluator.mdwn
index 5734f8a..180757c 100644 (file)
--- a/lambda_evaluator.mdwn
+++ b/lambda_evaluator.mdwn
@@ -1,8 +1,7 @@
 Lambda Evaluator
 ----------------
 
 Lambda Evaluator
 ----------------
 

-There is now a [lambda evaluator](http://lambda.jimpryor.net/lambda-let.html) available.
-It will allow you to write lambda terms and evaluate (that is, normalize) them, and inspect the results.
+This lambda evaluator will allow you to write lambda terms and evaluate (that is, normalize) them, and inspect the results.

 (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)`.  


@@ -23,7 +22,7 @@ Blank lines are fine.
 
 *Abbreviations*: In an earlier version, you couldn't use abbreviations. `\x y. y x x` had to be written `(\x (\y ((y x) x)))`. We've upgraded the parser though, so now it should be able to understand any lambda term that you can.
 
 
 *Abbreviations*: In an earlier version, you couldn't use abbreviations. `\x y. y x x` had to be written `(\x (\y ((y x) x)))`. We've upgraded the parser though, so now it should be able to understand any lambda term that you can.
 

-*Constants*: `true` and `false` are pre-defined to their standard values. So too are the combinators `S`, `K`, `I`, `C`, `B`, `W`, and `T`. Finally, integers will automatically be converted to Church numerals. (`0` is `\s z. z`, `1` is `\s z. s z`, and so on.)
+*Constants*:  (NOT YET IMPLEMENTED!) The combinators `S`, `K`, `I`, `C`, `B`, `W`, and `T` are pre-defined to their standard values. Also, integers will automatically be converted to Church numerals. (`0` is `\s z. z`, `1` is `\s z. s z`, and so on.)

 
 
 
 
 
 


@@ -40,10 +39,10 @@ let and = \l r. l r false in
 </textarea>
 <input id="PARSE" value="Normalize" type="button">
 <noscript><p>You may not see it because you have JavaScript turned off. Uffff!</p></noscript>
 </textarea>
 <input id="PARSE" value="Normalize" type="button">
 <noscript><p>You may not see it because you have JavaScript turned off. Uffff!</p></noscript>

-<script language=JavaScript src="code/tokens.js"></script>
-<script language=JavaScript src="code/parse.js"></script>
-<script language=JavaScript src="code/lambda.js"></script>
-<script language=JavaScript src="code/json2.js"></script>
+<script src="/code/lambda.js"></script>
+<script src="/code/tokens.js"></script>
+<script src="/code/parse.js"></script>
+<script src="/code/json2.js"></script>

 <pre id="OUTPUT">
 </pre>
 <script>
 <pre id="OUTPUT">
 </pre>
 <script>


@@ -106,7 +105,7 @@ Object.prototype.error = function (message, t) {
 Under the hood
 ---------------
 
 Under the hood
 ---------------
 

-The interpreter is written in JavaScript (which is not closely related to Java), and runs inside your browser.
+The interpreter is written in JavaScript and runs inside your browser.

 So if you decide to reduce a term that does not terminate (such as `((\x (x x)) (\x (x x)))`), it will be your 
 browser that stops responding, not the wiki server.
 
 So if you decide to reduce a term that does not terminate (such as `((\x (x x)) (\x (x x)))`), it will be your 
 browser that stops responding, not the wiki server.