We don't particularly care about fibonacci (which is the worst-case > scenario here, recursion works better in cases where functions are > bigger). However there is a plan how to go about it (without > reimplementing the JIT). It's even relatively simple. It's just that > fibonacci wasn't our major goal, but it does pop up every now and then > :-) And yes, it'll be reusable in other interpreters without trouble. > > What's the problem with recursive functions? I'm writing a interpreter that uses trampolining internally to implement tail-calls, and I'm wondering if I'll hit similar performance issues. As I'm working on a functional language my functions will tend to be quite small, and tail-calls quite common.
Timothy
_______________________________________________ pypy-dev mailing list [email protected] http://mail.python.org/mailman/listinfo/pypy-dev
