[Haskell-cafe] Definition of "tail recursive" wrt Folds
mark.spezzano at chariot.net.au
Wed Mar 25 03:24:17 EDT 2009
Just looking at the definitions for foldr and foldl I see that foldl is
(apparently) tail recursive while foldr is not.
Is it because foldl defers calling itself until last whereas foldr evaluates
itself as it runs?
What, strictly speaking, is the definition of tail recursive as opposed to
No virus found in this outgoing message.
Checked by AVG.
Version: 7.5.557 / Virus Database: 270.11.27/2021 - Release Date: 24/03/2009
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Haskell-Cafe