+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)
+
+Other Lambda Evaluators/Calculutors
+-----------------------------------