search for: harukizaemon

...r require the stack frame. A colleague of mine and I have looked into it and prima facie believe that it's entirely feasible. I wanted to ask the list if there was any interest, any objections, and of course, anything pointers/tips that may prove useful. Regards -- Simon Harris w: http://www.harukizaemon.com/ e: haruki.zaemon at gmail.com m: +61 417 505 611 t: @haruki_zaemon

On Monday 04 January 2010 01:12:55 Simon Harris wrote: > I'm investigating "improving" the TCO facilities in LLVM to provide for > "hard" tail calls. Specifically, this would involve extending the existing > implementation to discard the stack frame for the caller before executing > the callee. I would then like to extend this further by performing hard >

..., I do not understand what tail calls > LLVM is not currently eliminating that you plan to eliminate? Mutual recursion for a start: def a(n) n <= 0 ? "DONE" : b(n - 1) end def b(n) n <= 0 ? "DONE" : a(n - 1) end a(10000000) Boom! -- Simon Harris w: http://www.harukizaemon.com/ e: haruki.zaemon at gmail.com m: +61 417 505 611 t: @haruki_zaemon