On Wed, Apr 11, 2012 at 3:24 PM, wren ng thornton <[email protected]> wrote:
> Nope. For instance, the places where GC can happen are fully defined in > the Glasgow Haskell Compiler.... This, of course, is insufficient for multithreaded programs. > ...you can write tight loops which are strict > enough to guarantee no allocation and therefore no GC. My sense, as yet undemonstrated, is that it may be a bit more scalable in something like BitC, where unboxed types are available. shap
_______________________________________________ bitc-dev mailing list [email protected] http://www.coyotos.org/mailman/listinfo/bitc-dev
