Compiling polymorphism using intensional type analysis

Harper, Robert; Morrisett, Greg

doi:10.1145/199448.199475

Cited by 229 publications

(143 citation statements)

References 45 publications

Supporting

Mentioning

143

Contrasting

Order By: Relevance

“…The TIL compiler [1,9] uses intensional type analysis in a whole-program compiler to allow native data representations without committing to whole-program compilation. As with the Leroy coercion approach, polymorphic uses of objects require conditionals and boxing coercions to be inserted at use sites, and consequently there is the potential to slow down, rather than speed up, the program.…”

Section: Related Workmentioning

confidence: 99%

GC-Safe Interprocedural Unboxing

Petersen

Glew

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Modern approaches to garbage collection (GC ) require information about which variables and fields contain GC-managed pointers. Interprocedural flow analysis can be used to eliminate otherwise unnecessary heap allocated objects (unboxing), but must maintain the necessary GC information. We define a core language which models compiler correctness with respect to the GC, and develop a correctness specification for interprocedural unboxing optimizations. We prove that any optimization which satisfies our specification will preserve GC safety properties and program semantics, and give a practical unboxing algorithm satisfying this specification.

show abstract

Section: Related Workmentioning

confidence: 99%

GC-Safe Interprocedural Unboxing

Petersen

Glew

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Given the ability to write an intensional type constructor (Harper & Morrisett, 1995), such as the following, which maps product types to their first component but leaves other types alone,…”

Section: Injectivitymentioning

confidence: 99%

Parametricity, type equality, and higher-order polymorphism

Vytiniotis¹,

Weirich²

2010

J. Funct. Prog.

View full text Add to dashboard Cite

Propositions that express type equality are a frequent ingredient of modern functional programming|they can encode generic functions, dynamic types, and GADTs. Via the Curry-Howard correspondence, these propositions are ordinary types inhabited by proof terms, computed using runtime type representations. In this paper we show that two examples of type equality propositions actually do re ect type equality; they are only inhabited when their arguments are equal and their proofs are unique (up to equivalence.) We show this result in the context of a strongly normalizing language with higher-order polymorphism and primitive recursion over runtime type representations by proving Reynolds's abstraction theorem. We then use this theorem to derive \free" theorems about equality types. STEPHANIE WEIRICH University of Pennsylvania AbstractPropositions that express type equality are a frequent ingredient of modern functional programming-they can encode generic functions, dynamic types, and GADTs. Via the Curry-Howard correspondence, these propositions are ordinary types inhabited by proof terms, computed using runtime type representations. In this paper we show that two examples of type equality propositions actually do reflect type equality; they are only inhabited when their arguments are equal and their proofs are unique (up to equivalence.) We show this result in the context of a strongly normalizing language with higher-order polymorphism and primitive recursion over runtime type representations by proving Reynolds's abstraction theorem. We then use this theorem to derive "free" theorems about equality types.

show abstract

“…Intensional polymorphism [5,6,7] is an approach to compiling polymorphism that allows type information to be used at run time. This technique allows a compiler to use efficient data representations while preserving type safety.…”

Section: Related Workmentioning

confidence: 99%

Data Slicing: Separating the Heap into Independent Regions

Condit

Necula

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this paper, we present a formal description of data slicing, which is a type-directed program transformation technique that separates a program's heap into several independent regions. Pointers within each region mirror the structure of pointers in the original heap; however, each field whose type is a base type (e.g., the integer type) appears in only one of these regions. In addition, we discuss several applications of data slicing. First, data slicing can be used to add extra fields to existing data structures without compromising backward compatibility; the CCured project uses data slicing to preserve library compatibility in instrumented programs at a reasonable performance cost. Data slicing can also be used to improve locality by separating "hot" and "cold" fields in an array of data structures, and it can be used to protect sensitive data by separating "public" and "private" fields. Finally, data slicing can serve as a refactoring tool, allowing the programmer to split data structures while automatically updating the code that manipulates them.

show abstract

Compiling polymorphism using intensional type analysis

Cited by 229 publications

References 45 publications

GC-Safe Interprocedural Unboxing

GC-Safe Interprocedural Unboxing

Parametricity, type equality, and higher-order polymorphism

Data Slicing: Separating the Heap into Independent Regions

Contact Info

Product

Resources

About