Programming With Intersection Types, Union Types, and Polymorphism

Programming With Intersection Types, Union Types, and Polymorphism (1991)

by Benjamin C. Pierce

Citations:

49 - 3 self

User correction supplied by mph

Datum	Value	Source
TITLE	Programming With Intersection Types, Union Types, and Polymorphism	user correction - Legacy Corrections
AUTHOR NAME	Benjamin C. Pierce	user correction
AUTHOR AFFIL	School of Computer Science; Carnegie Mellon University	user correction
AUTHOR ADDR	Pittsburgh, PA 15213	user correction
ABSTRACT	Type systems based on intersection types have been studied extensively in recent years, both as tools for the analysis of the pure -calculus and, more recently, as the basis for practical programming languages. The dual notion, union types, also appears to have practical interest. For example, by refining types ordinarily considered as atomic, union types allow a restricted form of abstract interpretation to be performed during typechecking. The addition of second-order polymorphic types further increases the power of the type system, allowing interesting variants of many common datatypes to be encoded in the "pure" fragment with no type or term constants. This report summarizes a preliminary investigation of the expressiveness of a programming language combining intersection types, union types, and polymorphism.	user correction
YEAR	1991	user correction - Legacy Corrections
CITATIONS	39 found	ParsCit 1.0