Parametric polymorphism-universally

5Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In the 1980s, John Reynolds postulated that a parametrically polymorphic function is an ad-hoc polymorphic function satisfying a uniformity principle. This allowed him to prove that his set-theoretic semantics has a relational lifting which satisfies the Identity Extension Lemma and the Abstraction Theorem. However, his definition (and subsequent variants) have only been given for specific models. In contrast, we give a model-independent axiomatic treatment by characterising Reynolds’ definition via a universal property, and show that the above results follow from this universal property in the axiomatic setting.

Cite

CITATION STYLE

APA

Ghani, N., Forsberg, F. N., & Orsanigo, F. (2015). Parametric polymorphism-universally. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9160, pp. 81–92). Springer Verlag. https://doi.org/10.1007/978-3-662-47709-0_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free