A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf
.
Polymorphic type reconstruction for garbage collection without tags
1992
Proceedings of the 1992 ACM conference on LISP and functional programming - LFP '92
Several papers ([Appe189],[Goldberg9 1]) have recently claimed that garbage collection can be performed on untagged data in the presence of ML-style type polymorphism. They rely on the ability to reconstruct the type of any reachable object during garbage collection. The bad news is that this is false -there can be reachable objects in the program whose type cannot be determined by the garbage collector. The good news is that tag-free garbage collection can be performed anyway -any object whose
doi:10.1145/141471.141504
dblp:conf/lfp/GoldbergG92
fatcat:6xp7pv572jgzdgraxo5fsay25u