Compiler-directed type reconstruction for polymorphic languages
- 1 July 1993
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
In tagless implementations of polymorphic languages, therun-time types of data objects may not be completely determinedat compile-time. With ML-like static type-checking,a static type template can be produced for each polymorphicfunction that may be instantiated at run-time according tothe types of its actual arguments. Still, as noted in [5], itmay not be possible to reconstruct the types of some objectsthat are hidden inside a closure. This creates problemsfor applications like...Keywords
This publication has 6 references indexed in Scilit:
- Polymorphic type reconstruction for garbage collection without tagsPublished by Association for Computing Machinery (ACM) ,1992
- Tag-free garbage collection for strongly typed programming languagesPublished by Association for Computing Machinery (ACM) ,1991
- Runtime tags aren't necessaryHigher-Order and Symbolic Computation, 1989
- How to make ad-hoc polymorphism less ad hocPublished by Association for Computing Machinery (ACM) ,1989
- Principal type-schemes for functional programsPublished by Association for Computing Machinery (ACM) ,1982
- A theory of type polymorphism in programmingJournal of Computer and System Sciences, 1978