A logic for parametric polymorphism
- 25 January 2006
- book chapter
- Published by Springer Nature
- p. 361-375
- https://doi.org/10.1007/bfb0037118
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Coherence of subsumption, minimum typing and type-checking in F ≤Mathematical Structures in Computer Science, 1992
- Outline of a proof theory of parametricityPublished by Springer Nature ,1991
- An extension of system F with subtypingPublished by Springer Nature ,1991
- Subtyping + extensionality: Confluence of βηtop reduction in F≤Published by Springer Nature ,1991
- Parametricity of extensionally collapsed term models of polymorphism and their categorical propertiesPublished by Springer Nature ,1991
- On the Equivalence of Data RepresentationsPublished by Elsevier ,1991
- Functorial polymorphismTheoretical Computer Science, 1990
- Polymorphism is set theoretic, constructivelyPublished by Springer Nature ,1987
- Automatic synthesis of typed Λ-programs on term algebrasTheoretical Computer Science, 1985
- Abstract types have existential typesPublished by Association for Computing Machinery (ACM) ,1985