On Tue, Aug 4, 2009 at 7:30 AM, Sam Martin<sam.mar...@geomerics.com> wrote:
I can picture similar situations arising in Haskell where for suitable expressions the compiler could in theory determine that garbage collection would be unnecessary for a lump of temporary data and simply allocate/deallocate when starting/finishing evaluating the thunk. The goal being to simplify garbage collection for this kind of temporary allocation.Any thoughts? Ta, Sam
Sounds like region inference to me. (https://secure.wikimedia.org/wikipedia/en/wiki/Region_inference) -- gwern
signature.asc
Description: OpenPGP digital signature
_______________________________________________ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell
