Author:
CRARY KARL,WEIRICH STEPHANIE,MORRISETT GREG
Abstract
Intensional polymorphism, the ability to dispatch to different routines based on types at run
time, enables a variety of advanced implementation techniques for polymorphic languages,
including tag-free garbage collection, unboxed function arguments, polymorphic marshalling
and attened data structures. To date, languages that support intensional polymorphism
have required a type-passing (as opposed to type-erasure) interpretation where types are
constructed and passed to polymorphic functions at run time. Unfortunately, type-passing
suffers from a number of drawbacks: it requires duplication of run-time constructs at the
term and type levels, it prevents abstraction, and it severely complicates polymorphic closure
conversion. We present a type-theoretic framework that supports intensional polymorphism,
but avoids many of the disadvantages of type passing. In our approach, run-time type
information is represented by ordinary terms. This avoids the duplication problem, allows us
to recover abstraction, and avoids complications with closure conversion. In addition, our
type system provides another improvement in expressiveness; it allows unknown types to be
refined in place, thereby avoiding certain beta-expansions required by other frameworks.
Publisher
Cambridge University Press (CUP)
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A Graded Modal Dependent Type Theory with a Universe and Erasure, Formalized;Proceedings of the ACM on Programming Languages;2023-08-30
2. A Graded Modal Dependent Type Theory with a Universe and Erasure, Formalized;P ACM PROGRAM LANG;2023
3. A Typed Slicing Compilation of the Polymorphic RPC calculus;23rd International Symposium on Principles and Practice of Declarative Programming;2021-09-06
4. Featherweight Swift: a Core calculus for Swift’s type system;Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering;2020-11-15
5. Language-integrated provenance by trace analysis;Proceedings of the 17th ACM SIGPLAN International Symposium on Database Programming Languages - DBPL 2019;2019