A Logic for Parametric Polymorphism

In 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 datatypes, with corresponding proof principles of induction, co-induction and simulation.

• Type: Conference
• Year: 1993
• Where: TLCA
• Authors: Gordon D. Plotkin, Martín Abadi
• Keywords: Logic, Parametric Polymorphism, Parametricity Yields—for Example—encodings, Theoretical Computer Science, TLCA 1993