[Haskell-cafe] Re: Debunking tail recursion

[Ilya Tsindlekht]

On Sat, May 19, 2007 at 09:16:46PM +0100, Jon Fairbairn wrote:
> Ilya Tsindlekht <eilya497 at 013.net> writes:
> > By definition, tail recursive function is recursive function in which
> > the value returned from a recursive call is immediately returned without
> > modification as value of the top-level invocation, which is true for
> > foldl defined as above.
> 
> Sure. Did I say otherwise?
Sorry, I thought you were saying foldl is not tail-recursive. I must
have not read your message carefully enough, mea culpa.
> 
> -- 
> Jón Fairbairn                                 Jon.Fairbairn at cl.cam.ac.uk