Show simple item record

dc.contributor.authorPlotkin, Gordon
dc.contributor.authorAbadi, Martin
dc.contributor.authorCardelli, Luca
dc.coverage.spatial10en
dc.date.accessioned2003-11-05T17:12:31Z
dc.date.available2003-11-05T17:12:31Z
dc.date.issued2003-11-05T17:12:31Z
dc.identifier.urihttp://hdl.handle.net/1842/210
dc.description.abstractIn this paper we study the interaction of subtyping and parametricity. We describe a logic for a programming language with parametric polymorphism and subtyping. The logic supports the formal definition and use of relational parametricity. We give two models for it, and compare it with other formal systems for the same language. In particular, we examine the “Penn interpretation” of subtyping as implicit coercion. Without subtyping, parametricity yields, for example, an encoding of abstract types and of initial algebras, with the corresponding proof principles of simulation and induction. With subtyping, we obtain partially abstract types and certain initial order-sorted algebras, and may derive proof principles for them.en
dc.format.extent232659 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.subjectLaboratory for Foundations of Computer Science
dc.titleSubtyping and Parametricityen
dc.typePreprinten


Files in this item

This item appears in the following Collection(s)

Show simple item record