A new module for performing tail-call elimination

[Jeremy Sanders]

Robin Becker wrote:

> I believe the classic answer is Ackermann's function
> 
> http://demonstrations.wolfram.com/RecursionInTheAckermannFunction/
> 
> which is said to be not "primitive recursive" ie cannot be unwound into
> loops; not sure whether that implies it has to be recursively defined or
> can perhaps be broken down some other way. For more eye-glazing

But am I right in thinking that TCO doesn't work for Ackermann's function, 
at least not as it's written down in the above page?

J.