• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Formal Parametric Polymorphism (1993)

Cached

  • Download as a PDF

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]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Martin Abadi , Luca Cardelli , Pierre-Louis Curien
Venue:THEORETICAL COMPUTER SCIENCE
Citations:112 - 5 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

Versions

  • Version 0
  • Version 1
  • Version 2
  • Version 3
  • Version 4

Version History

Metadata Version 4

User correction supplied by mph

DatumValueSource
TITLE Formal Parametric Polymorphism user correction - Legacy Corrections
AUTHOR NAME Martin Abadi user correction
AUTHOR AFFIL Digital Equipment Corporation, Systems Research Center user correction
AUTHOR NAME Luca Cardelli user correction
AUTHOR AFFIL Digital Equipment Corporation, Systems Research Center user correction
AUTHOR NAME Pierre-Louis Curien user correction
AUTHOR AFFIL CNRS, Ecole Normale Supérieure user correction
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. user correction
YEAR 1993 INFERENCE
VENUE THEORETICAL COMPUTER SCIENCE user correction
VENUE TYPE CONFERENCE INFERENCE
PAGES 361--375 INFERENCE
VOLUME 121 INFERENCE
CITATIONS 21 found ParsCit 1.0
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University