The genericity theorem and parametricity in the polymorphic λ-calculus
- 6 December 1993
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 121 (1-2) , 323-349
- https://doi.org/10.1016/0304-3975(93)90093-9
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Categorical data types in parametric polymorphismMathematical Structures in Computer Science, 1994
- Constructive natural deduction and its ‘ω-set’ interpretationMathematical Structures in Computer Science, 1991
- A semantic basis for QuestJournal of Functional Programming, 1991
- Functorial polymorphism: Theoretical computer science 70 (1990) 35-64Theoretical Computer Science, 1990
- Functorial polymorphismTheoretical Computer Science, 1990
- A small complete categoryAnnals of Pure and Applied Logic, 1988
- The system F of variable types, fifteen years laterTheoretical Computer Science, 1986
- The Category-Theoretic Solution of Recursive Domain EquationsSIAM Journal on Computing, 1982
- A generalization of the functorial calculusJournal of Algebra, 1966