Raymond Toy wrote:
One question, though, on the tail-recursive feature. It's nice
to
have but is it really, really important? Elisp isn't (right?), and
we've been doing fine without proper tail recursion.
We've been *surviving* without tail recursion optimisation.
Ultimately, tail recursion can always be converted to explicit
iteration, which is what you need to do in elisp if you don't want to
take a performance hit.
However, it's effectively a bug (IMHO) which we've had to work around.
It would be nice if algorithms which would naturally be implemented
using tail recursion could be written in their natural form.
--
Glynn Clements <glynn(a)sensei.co.uk>