Re: [Haskell-cafe] Stack Overflow, tail recursion and CPS

Hi Eugene,
tried that, but since the action to be evaluated is the insertion into a
structure that won't work.
The strictness here doesn't go deep enough, it stopps short.
Günther
Am 14.01.2009, 18:27 Uhr, schrieb Eugene Kirpichov
Use foldl' ?
2009/1/14 Günther Schmidt
: Hi all,
I get a stack overflow when I want to insert a huge, lazy list into a Map.
I have changed the insertion algo to use foldl to make it tail-recursive but still get a stack overflow as the "insert" remains lazy.
Could CPS be a solution in these cases?
Günther
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
-- Erstellt mit Operas revolutionärem E-Mail-Modul: http://www.opera.com/mail/
participants (1)
-
Günther Schmidt