On Tue, Dec 21, 2010 at 11:41 AM, nicolas.o...@gmail.com < nicolas.o...@gmail.com> wrote:
> > Those are mutual recursive functions. Trying to define them as regular > > functions will quickly result in a stack overflow. > > You could use trampoline but in my experience you will take a significant > > performance hit. > > Lazy sequences are a way to efficiently represent mutually recursive > > computations w/o TCO. > > David > > > I am not sure to understand. > > Neither functions are tail-recursive. So in this situation enabling > tail-recursion > would not help. > > Best, > > Nicolas > With TCO mutually recursive functions do not consume the stack. The same is true for well constructed lazy sequences. David -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en
