Abstract
We present a garbage collection scheme based on reference counting
and region inference which, unlike the standard reference counting algorithm,
handles cycles correctly. In our algorithm, the fundamental operations of
region inference are performed dynamically. No assistance is required from the
programmer or the compiler, making our algorithm particularly well-suited for
use in dynamically-typed languages such as scripting languages. We provide a
detailed algorithm and demonstrate how it can be implemented efficiently.
Notes
We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.ca
