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

Justin Bailey jgbailey at gmail.com
Fri Dec 21 12:13:04 EST 2007

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?


More information about the Haskell-Cafe mailing list