+Improvements we hope to add:
+
+* detecting some common cases of non-normalizing terms (the problem of determining in general whether a term will normalize is undecidable)
+* returning results in combinator form (the evaluator already accepts combinators as input)
+* displaying reductions one step at a time
+* specifying the reduction order and depth
+* allow other binders such as ∀ and ∃ (though these won't be interpreted as doing anything other than binding variables)
+
+<a name="other_evaluators"></a>
+Other Lambda Evaluators/Calculutors
+-----------------------------------
+
+* [Peter Sestoft's Lambda Calculus Reducer](http://www.itu.dk/people/sestoft/lamreduce/index.html): Very nice! Allows you to select different evaluation strategies, and shows stepwise reductions.
+* [Chris Barker's Lambda Tutorial](http://homepages.nyu.edu/~cb125/Lambda)
+* [Penn Lambda Calculator](http://www.ling.upenn.edu/lambda/): Pedagogical software developed by Lucas Champollion, Josh Tauberer and Maribel Romero. Linguistically oriented. Requires installing Java (Mac users will probably already have it installed).
+* [Mike Thyer's Lambda Animator](http://thyer.name/lambda-animator/): Graphical tool for experimenting with different reduction strategies. Also requires installing Java, and Graphviz.
+* [Matt Might's Lambda Evaluator](http://matt.might.net/articles/implementing-a-programming-language/) in Scheme (R5RS and Racket).
+
+See also: