Hi O. Masanori and all, Thank you so much for your kindly explanation.
Sure that 'fold-right' itself is strict as you say. But I think that various right-folded-type loops, which can be stopped middle of a list, can be lazy. The continuation, which should be calculated in the later steps, should be determined when the list is searched to that point from head of it. https://gist.github.com/2894687 https://gist.github.com/2896939 Does anyone have an idea not to eat large stack with an abstraction for these loops? -- 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
