Hi Gabriele, >REBOL 1.0 was tail recursive, and it was SLOW. This is because, as >Joe Marshall expalined to me, handling tail recursion is not an >easy thing to do. I'd like to see tail recursion back in REBOL, >but I'm not sure if I'd want the complexity of the interpreter to >increase. I'd prefer a better solution, such as testing for tail >recursion only on function that require it: Not to forget that REBOL 1.0 had problems with correctly interpreting some constructs, when they were recalled recursively. Recall that we had to use copy on a foreach loop and even then there were problems occassionally. Elan
