On 17 July 2013 06:51, Sandro Magi <[email protected]> wrote: > CHICKEN is a significant simplification of the techniques used in > STOPLESS, and they do describe it in quite some detail in sections > 4.3-4.5. Furthermore, the amount to be copied in one collection cycle is > configurable, so it's quite a promising set of tradeoffs.
I want to not be too worried about introducing read-barriers in high-level systems anyway, because once you've introduced that indirection you can use them to implement other things like Automatic Mutual Exclusion. I think that, for the class of applications where region inference doesn't get you very far*, the extra abstractions you can implement by introducing read barriers may be worthwhile on their own. * of course, you can use region inference in various forms to do exclusion statically, and I attempted (though I failed) to retrofit this into a popular production runtime last year. In oversimplification, if the reference you have is linear, you know nobody is going to go mutating the target under your feet. -- William Leslie Notice: Likely much of this email is, by the nature of copyright, covered under copyright law. You absolutely may reproduce any part of it in accordance with the copyright law of the nation you are reading this in. Any attempt to deny you those rights would be illegal without prior contractual agreement. _______________________________________________ bitc-dev mailing list [email protected] http://www.coyotos.org/mailman/listinfo/bitc-dev
