newlispfanclub.alh.net

Hi,

I am new to newlisp and did my standard test to it:

(define (mt n) (println n)(mt (+ 1 n)))
(mt 1)

that should run infinte in any tail recursive lisp.
It crashed at 2048 in newlisp, but amazingly fast!

Is there no tail recursion detection or am doing it wrong?

Thank you,

Ralf