On Tue, Dec 21, 2010 at 12:09 PM, nicolas.o...@gmail.com < nicolas.o...@gmail.com> wrote:
> > Yes I know, I thought the way I wrote the code was clear about that :) > > I am sorry, I did not understand. > > So let me try to explicit your transformation (please correct me if I am > wrong): > - start with some mutually recursive functions: a and b, for example > - create a "lazy stack" for the recursive calls using a lazy-seq > - reduce the seq until you find the result of the computation? > > Am I getting the idea or not at all? > You can start with as many mutually recursive functions as you want. But yes, that is the general idea. 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
