On 23/07/2014 10:34 PM, David Jeske wrote: > Easiest programming model? Precise generational compacting > collector... if you can accept the world-stop problem.
The easiest programming model is clearly an incremental collector, like full ref counting with cycle collection. Mismanaged finite resources like file handles are then guaranteed to be collected as soon as they are no longer referenced. This GC is just very expensive. Sandro _______________________________________________ bitc-dev mailing list [email protected] http://www.coyotos.org/mailman/listinfo/bitc-dev
