[<<][plt][>>][..]
Sun Apr 19 00:49:38 CEST 2009

Using fold vs. explicit tail recursion

I often find myself writing tail recursive loops, accumulating results
in (multiple) stacks, then reversing them in the end.  Is this pattern
necessary?

I guess what I'm looking for is an "unpacked" fold, where individually
named state objects get passed during iteration.  This makes sense for
a left fold.  Does it also work for a right fold?



[Reply][About]
[<<][plt][>>][..]