Hi John, > On Mon, Dec 13, 2010 at 10:45 AM, Peter Simons <[email protected]> wrote: > >> Relying exclusively on GHC's ability to limit run-time memory >> consumption feels like an odd choice for this task. It's nice that >> this feature exists in GHC, but it's inherently non-portable and >> outside of the scope of the language. There really ought to be a >> better way to catch an infinite loop that this. > > It all comes down to picking the correct memory limit. How do you > propose to do it? How did you come up with the number 32M? That > number would have been a disaster for me.
I beg your pardon? I didn't say anything about "32M". I said that designing software to rely on a GHC-enforced memory limit as a means of "dealing" with infinite loops feels really not like a particularly good solution. Take care, Peter _______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
