[MLton] Re: [Haskell-cafe] fastest Fibonacci numbers in the West
Thu, 27 Jan 2005 13:17:14 -0600
What a pain. I wonder where else the library uses space (stack in particular).
I really don't like the idea of MLton programs seg-faulting, ever.
I guess that if we could estimate the amount of stack needed then we could
see if it would fit. Alternatively we could catch seg-fault and see if we
were in GMP code, so at least the error message would be better.
(We can also be pimped by the GCD, which does allocation in the malloc heap.)