Hostname: page-component-7c8c6479df-94d59 Total loading time: 0 Render date: 2024-03-28T19:56:04.381Z Has data issue: false hasContentIssue false

Intersection types and bounded polymorphism

Published online by Cambridge University Press:  01 April 1997

BENJAMIN C. PIERCE
Affiliation:
Computer Science Dept., Lindley Hall 215, Indiana University, Bloomington, IN 47405, USA

Abstract

Intersection types and bounded quantification are complementary extensions of a first-order programming language with subtyping. We define a typed λ-calculus combining these extensions, illustrate its unusual properties, and develop basic proof-theoretic and semantic results leading to algorithms for subtyping and typechecking.

Type
Research Article
Copyright
© 1997 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)