Hi Yasuyuki,

I must admit, It is not clear to me. But I think a reference to the head of the list is somehow used as an argument to the recursive function, which adds the next value to the list. So that it is tail-recursive again. Or something like that.

But I may also be completely off.

Greets,

Edgar


On Tue, Nov 9, 2010 at 1:17 PM, Yasuyuki Ogawa <yuka_pon20@yahoo.co.jp> wrote:
Hi Edgar,

Thank you for interesting wiki pages!
Roughly speaking, because of laziness, tail recursion is not always necessary, modulo cons but useful enough...or something like that?
I'll study!

-- Yasuyuki


(2010/11/08 19:21), edgar klerks wrote:
Hi Yasuyuki,

Here is some resource Brent produced, why tail-recursion isn't that
important in haskell:

http://www.haskell.org/pipermail/haskell-cafe/2009-March/058607.html
(http://www.haskell.org/haskellwiki/Tail_recursion)

I think it is nice to have some background (and it is pretty interesting).

Greets,

Edgar


--------------------------------------
Get the new Internet Explorer 8 optimized for Yahoo! JAPAN
http://pr.mail.yahoo.co.jp/ie8/
_______________________________________________
Beginners mailing list
Beginners@haskell.org
http://www.haskell.org/mailman/listinfo/beginners