On 2007-06-13, Steve Howell <[EMAIL PROTECTED]> wrote: > You would just change the language definition to say that once > you enter f(), any call to f() from within f() behaves as if > the recursively called f() still points to the originally bound > version of f. To want any other behavior would be absurd, > anyhow.
There's a reason it's generally refered to as "tail-call" optimization and not "tail-recursive" optimization. The former is more general, and, I believe, easier to implement than the latter. -- Neil Cerutti The peace-making meeting scheduled for today has been cancelled due to a conflict. --Church Bulletin Blooper -- http://mail.python.org/mailman/listinfo/python-list
