Lambda calculus evaluator false reports normal form

[Darkwing3125]

Expected behaviour: a->(b->b)a evaluates to a->a

Actual behaviour: a->(b->b)a is reported as the beta-normal form, even when there is a reducible redex

[dallaylaen]

This is as intended - though not documented properly.

The idea was that terms that lack a normal form but terminate due to lack of arguments (e.g. CL(CL)) should behave the same, whether as combinators or lambdas. Hence call-by-name. The documentation states it's leftmost-outermost / normal, which is wrong.

I think of adding a flag to make lambdas eager in later versions. Thanks for reporting.