see http://blog.zachallaun.com/post/jumping-julia to work around not having TCO and still use recursion to traverse LARGE data structures without stackoverflow. That's also how a bunch of other languages (e.g. Scala & F#) do this (called "trampolining").
On Sunday, November 24, 2013 at 3:49:14 PM UTC+1, Piotr X wrote: > > Hi! > > First of all, let me thank you for bringing another language to the world! > Always good to see a new star on the sky. > > Coming for the Python and Scheme side of the table (well, it is a round > table..), I have a couple of quick question before getting my hands on > Julia: > > 1) I understand that femto-lisp was integragted into Julia. > 1.1) Is it possible to to work mainly with femto-lisp, using Julia-lang > packages, its concurrency/parallel computing libraries and its fast program > generating compiler? > 1.2.) Does tje Julia-lang implementation of femto-lisp have TCO (Tail call > optimization)? > 1.3.) What important scheme like features are missing from femto-lisp? > > 2) I found a Julia-Dev thread on TCO. Is there any news on that? > > Regards, > > Piotr >
