[Haskell-cafe] A question about stack overflow

[Huazhi (Hank) Gong]

Hi, all

I'm just a newbie for Haskell and functional programming world. The idea I
currently read is quite different and interesting.

I have one general question about the recursively looping style. For
example:

myMax [ ] = error "empty list"

myMax [x] = x

myMax [x:xs] = if x>= (myMax xs) then x else (myMax xs)

 

I just list out this kind of very simple program. However, if the list size
if a big number such as 10000000, the Winhug will report that the stack is
overflow. 

Does it mean that the functional programming is lacking of scalability? I do
know that we can manually change the stack size for it. But that's not a
good solution according to my opinion.

 

Yours, Hank

-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org//pipermail/haskell-cafe/attachments/20060627/b8d04793/attachment-0001.htm