2010/2/14 Florian Weimer <[email protected]>: > Most of the time, the concern is about pause times and the lack of > upper bounds on them. With traditional reference counting, this is > still a problem because if the last reference to a large data > structure goes away, you need to free the whole data structure at > once.
And this could be done... lazily! ;) _______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
