Re: [Haskell-cafe] Why does this blow the stack?

Justin Bailey wrote:

Given this function:

dropTest n = head . drop n $ [1..]

I get a stack overflow when n is greater than ~ 550,000 . Is that inevitable behavior for large n? Is there a better way to do it?

Just for fun, throw in dropTest :: Int -> Int and experiment again! :)