On Tuesday 08 December 2009 13:39:50 Kresten Krab Thorup wrote: > FYI, I wrote a blob on how I encode tail recursion in Erjang: > http://bit.ly/6XIma1 . > > This technique is applicable (and surprisingly quite fast) if a > language encoding (a) passes a "thread state" to all operations, and > (b) are encoded so that functions do not return primitive types. > Granted - those are severe restrictions, but they apply to Erjang. > Could apply to other languages encoded for the JVM as well.
Yes. There are complications with structs and TCO because structs can be stack allocated in the current stack frame and TCO can delete that stack frame. -- Dr Jon Harrop, Flying Frog Consultancy Ltd. http://www.ffconsultancy.com/?e -- You received this message because you are subscribed to the Google Groups "JVM Languages" group. To post to this group, send email to jvm-langua...@googlegroups.com. To unsubscribe from this group, send email to jvm-languages+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/jvm-languages?hl=en.
