Tag-free Garbage Collection Using Explicit Type Parameters (0)
| Venue: | In Proceedings of the 1994 ACM Conference on Lisp and Functional Programming |
| Citations: | 65 - 0 self |
BibTeX
@INPROCEEDINGS{Tolmach_tag-freegarbage,
author = {Andrew Tolmach},
title = {Tag-free Garbage Collection Using Explicit Type Parameters},
booktitle = {In Proceedings of the 1994 ACM Conference on Lisp and Functional Programming},
year = {},
pages = {1--11},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We have constructed a practical tag-free garbage collector based on explicit type parameterization of polymorphic functions, for a dialect of ML. The collector relies on type information derived from an explicitly-typed 2nd-order representation of the program, generated by the compiler as a byproduct of ordinary Hindley-Milner type inference. Runtime type manipulations are performed lazily to minimize execution overhead. We present details of our implementation approach, and preliminary performance measurements suggesting that the overhead of passing type information explicitly can be made acceptably small. 1 Introduction Parametric polymorphic functions, as found in languages such as ML and Haskell, are traditionally compiled into code that executes uniformly regardless of the types of its arguments. This approach requires adopting a uniform data representation for all types. Typically, one pretends that every value fits in a single machine word; values that do not fit must be pointe...
