Show simple item record

dc.contributor.authorPlotkin, Gordon
dc.contributor.authorAbadi, Martin
dc.date.accessioned2003-11-05T15:57:49Z
dc.date.available2003-11-05T15:57:49Z
dc.date.issued2003-11-05T15:57:49Z
dc.identifier.urihttp://hdl.handle.net/1842/205
dc.description.abstractIn this paper we introduce a logic for parametric polymorphism. Just as LCF is a logic for the simply-typed -calculus with recursion and arithmetic, our logic is a logic for System F. The logic permits the formal presentation and use of relational parametricity. Parametricity yields—for example—encodings of initial algebras, final co-algebras and abstract datatypes, with corresponding proof principles of induction, co-induction and simulation.en
dc.format.extent189662 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.subjectLaboratory for Foundations of Computer Science
dc.titleA Logic for Parametric Polymorphismen
dc.typePreprinten


Files in this item

This item appears in the following Collection(s)

Show simple item record