[Haskell-cafe] GHC 7.0.1 developer challenges
simons at cryp.to
Tue Dec 14 19:48:20 CET 2010
> On Mon, Dec 13, 2010 at 10:45 AM, Peter Simons <simons at cryp.to> 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
More information about the Haskell-Cafe