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.)
+(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)`.
+*Lambda terms*: lambda terms are written with a backslash, thus: `((\x (\y x)) z)`.
If you click "Normalize", the system will try to produce a normal-form lambda expression that your original term reduces to (~~>). So `((\x (\y x)) z)` reduces to `(\y z)`.
---------------
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
+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.
The main code is [here](http://lambda.jimpryor.net/code/lambda.js). Suggestions for improvements welcome.
-The code is based on:
+The code is based on:
* Chris Barker's JavaScript lambda calculator
* [Oleg Kiselyov's Haskell lambda calculator](http://okmij.org/ftp/Computation/lambda-calc.html#lambda-calculator-haskell).