4 There is now a [lambda evaluator](http://lambda.jimpryor.net/lambda-let.html) available.
5 It will allow you to write lambda terms and evaluate them, with full ability to inspect the results.
6 (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.)
8 *Lambda terms*: lambda terms are written with a backslash, thus: `((\x (\y x)) z)`.
9 If you click "Reduce", the system will produce a lambda term that is guaranteed to be reduction equivalent (`<~~>`) with the original term.
11 *Let*: in order to make building a more elaborate system easier, it is possible to define values using `let`.
12 In this toy system, `let`s should only be used at the beginning of a file. If we have, for intance,
14 let true = (\x (\y x)) in
15 let false = (\x (\y y)) in