International Workshop on Logic, Language, Information, and Computation

WoLLIC 2015: Logic, Language, Information, and Computation pp 81-92

Parametric Polymorphism — Universally

  • Neil Ghani
  • Fredrik Nordvall Forsberg
  • Federico Orsanigo
Conference paper

DOI: 10.1007/978-3-662-47709-0_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9160)
Cite this paper as:
Ghani N., Forsberg F.N., Orsanigo F. (2015) Parametric Polymorphism — Universally. In: de Paiva V., de Queiroz R., Moss L., Leivant D., de Oliveira A. (eds) Logic, Language, Information, and Computation. WoLLIC 2015. Lecture Notes in Computer Science, vol 9160. Springer, Berlin, Heidelberg

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.

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  • Neil Ghani
    • 1
  • Fredrik Nordvall Forsberg
    • 1
  • Federico Orsanigo
    • 1
  1. 1.University of StrathclydeGlasgowUK

Personalised recommendations