Unboxed Values and Polymorphic Typing Revisited (1995)
Cached
Download Links
- [www-pu.informatik.uni-tuebingen.de]
- [www.informatik.uni-freiburg.de]
- DBLP
Other Repositories/Bibliography
| Venue: | In The Seventh International Conference on Functional Programming Languages and Computer Architecture |
| Citations: | 12 - 0 self |
BibTeX
@INPROCEEDINGS{Thiemann95unboxedvalues,
author = {Peter J. Thiemann},
title = {Unboxed Values and Polymorphic Typing Revisited},
booktitle = {In The Seventh International Conference on Functional Programming Languages and Computer Architecture},
year = {1995},
pages = {24--35},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Polymorphic languages require that values passed to polymorphic functions all have a representation of the same size. Any value whose natural representation does not fit this size must be boxed, i.e. represented by a pointer to a heap-allocated record. Major performance gains can be achieved by handling values in their natural, unboxed representation whenever possible. We show that not only monomorphic functions, but also many polymorphic functions can handle unboxed values if the function calling convention of the underlying implementation satisfies a mild assumption. A representation type system is deøned which describes boxing requirements. A type reconstruction algorithm is given which translates an untyped program into an explicitly typed program where all changes of representation are made explicit. Furthermore, we define an abstract machine which employs the required calling convention and is an adequate operational model for the representation type system.
