Formal 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
| Venue: | THEORETICAL COMPUTER SCIENCE |
| Citations: | 112 - 5 self |
BibTeX
@INPROCEEDINGS{Abadi93formalparametric,
author = {Martin Abadi and Luca Cardelli and Pierre-Louis Curien},
title = {Formal Parametric Polymorphism},
booktitle = {THEORETICAL COMPUTER SCIENCE},
year = {1993},
pages = {361--375},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A polymorphic function is parametric if its behavior does not depend on the type at which it is instantiated. Starting with Reynolds's work, the study of parametricity is typically semantic. In this paper, we develop a syntactic approach to parametricity, and a formal system that embodies this approach, called system R . Girard's system F deals with terms and types; R is an extension of F that deals also with relations between types. In R , it is possible to derive theorems about functions from their types, or "theorems for free", as Wadler calls them. An easy "theorem for free" asserts that the type "(X)XBool contains only constant functions; this is not provable in F. There are many harder and more substantial examples. Various metatheorems can also be obtained, such as a syntactic version of Reynolds's abstraction theorem.
