Typed compilation of recursive datatypes

Authors:
Joseph C. Vanderwaart;Derek Dreyer;Leaf Petersen;Karl Crary;Robert Harper;Perry Cheng
Affiliations:
Carnegie Mellon University, Pittsburgh, PA;Carnegie Mellon University, Pittsburgh, PA;Carnegie Mellon University, Pittsburgh, PA;Carnegie Mellon University, Pittsburgh, PA;Carnegie Mellon University, Pittsburgh, PA;Carnegie Mellon University, Pittsburgh, PA
Venue:
Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation
Year:
2003

Citing 7
Cited 4

Subtyping recursive types

ACM Transactions on Programming Languages and Systems (TOPLAS)
TIL: a type-directed optimizing compiler for ML

PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
Coinductive axiomatization of recursive type equality and subtyping

Fundamenta Informaticae - Special issue: typed lambda-calculi and applications, selected papers
Deciding type equivalence in a language with singleton kinds

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Typed compilation of inclusive subtyping

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Recursive subtyping revealed: (functional pearl)

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
The Definition of Standard ML

The Definition of Standard ML

An open and shut typecase

TLDI '05 Proceedings of the 2005 ACM SIGPLAN international workshop on Types in languages design and implementation
Recursive type generativity

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
A verifiable SSA program representation for aggressive compiler optimization

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Recursive type generativity

Journal of Functional Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Standard ML employs an opaque (or generative) semantics of datatypes, in which every datatype declaration produces a new type that is different from any other type, including other identically defined datatypes. A natural way of accounting for this is to consider datatypes to be abstract. When this interpretation is applied to type-preserving compilation, however, it has the unfortunate consequence that datatype constructors cannot be inlined, substantially increasing the run-time cost of constructor invocation compared to a traditional compiler. In this paper we examine two approaches to eliminating function call overhead from datatype constructors. First, we consider a transparent interpretation of datatypes that does away with generativity, altering the semantics of SML; and second, we propose an interpretation of datatype constructors as coercions, which have no run-time effect or cost and faithfully implement SML semantics.