A logic for parametric polymorphism (1993)
Cached
Download Links
- [research.microsoft.com]
- [research.microsoft.com]
- [lucacardelli.name]
- [www.pps.jussieu.fr]
- [pa.bell-labs.com]
- [ftp.digital.com]
- [research.microsoft.com]
- [pa.bell-labs.com]
- [www.dcs.ed.ac.uk]
- [homepages.inf.ed.ac.uk]
- [www.dcs.ed.ac.uk]
- [www.dcs.ed.ac.uk]
- [www.hpl.hp.com]
- DBLP
Other Repositories/Bibliography
by
Gordon Plotkin
,
Martín Abadi
| Venue: | Theoretical Computer Science |
| Citations: | 112 - 5 self |
BibTeX
@INPROCEEDINGS{Plotkin93alogic,
author = {Gordon Plotkin and Martín Abadi},
title = {A logic for parametric polymorphism},
booktitle = {Theoretical Computer Science},
year = {1993},
pages = {361--375},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 abstract datatypes, with corresponding proof principles of induction, co-induction and simulation. 1
