1. What are the contributions in "A logic for parametric polymorphism" ?
In this paper the authors introduce a logic for parametric polymorphism.
read more
A Logic for Parametric Polymorphism
Gordon Plotkin,Martín Abadi +1 more
- 16 Mar 1993
- pp 361-375
TL;DR: The logic permits the formal presentation and use of relational parametricity, and yields-for example-encodings of initial algebras, final co-algebra and abstract datatypes, with corresponding proof principles of induction, co-induction and simulation.
read more
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Most frequently asked questions
Citations
•Book
Types and Programming Languages
Benjamin C. Pierce
- 01 Jan 2002
TL;DR: This text provides a comprehensive introduction both to type systems in computer science and to the basic theory of programming languages, with a variety of approaches to modeling the features of object-oriented languages.
2.7K
•Book
Advanced Topics in Types and Programming Languages
Benjamin C. Pierce
- 01 Dec 2004
TL;DR: Topics covered include precise type analyses, which extend simple type systems to give them a better grip on the run time behavior of systems; type systems for low-level languages; applications of types to reasoning about computer programs; type theory as a framework for the design of sophisticated module systems; and advanced techniques in ML-style type inference.
Abstraction for concurrent objects
TL;DR: This study formally shows that these conditions can be characterized in terms of observational refinement and provides a new understanding of sequential consistency and linearizability in Terms of abstraction of dependency between computation steps of client programs.
182
Parametric polymorphism and operational equivalence
TL;DR: In this paper, an approach to Reynolds' notion of relational parametricity is developed that works directly on the syntax of a programming language, using a novel closure operator to relate operational behaviour to parametric properties of types.
Parametric Polymorphism and Operational Equivalence (Preliminary Version)
TL;DR: An operationally-based approach to Reynolds' notion of relational parametricity is developed for an extension of Plotkin's PCF with ∀types and lazy lists and the resulting logical relation is shown to be a useful tool for proving properties of polymorphic types up to a notion of operational equivalence based on Morris-style contextual equivalence.
153
References
•Proceedings Article
Types, Abstraction and Parametric Polymorphism.
John C. Reynolds
- 01 Jan 1983
TL;DR: The findings of a Web-based questionnaire aimed at discovering both patterns of use of videoconferencing systems within HP and the reasons people give for either not using, or for using such systems are discussed.
978
A Final Coalgebra Theorem
Peter Aczel,Nax Paul Mendler +1 more
- 05 Sep 1989
TL;DR: It is proved that every set-based functor on the category of classes has a final coal algebra, which strengthens the final coalgebra theorem announced in the book “Non-well-founded Sets”, by the first author.
369
Related Papers (5)
John C. Reynolds
- 01 Jan 1983
[...]
Philip Wadler
- 01 Nov 1989
Martín Abadi,Luca Cardelli,Pierre-Louis Curien +2 more
- 01 Mar 1993
John C. Reynolds
- 09 Apr 1974