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
Reynolds' abstraction theorem shows how a typing judgement in System F can be translated into a rela...
Research supported by the Engineering and Physical Sciences Research Council (EP/L022478/1) and the ...
This paper combines reflexive-graph-category structure for relational parametricity with fibrational...
In the 1980s, John Reynolds postulated that a parametrically polymorphic function is an ad-hoc polym...
In the 1980s, John Reynolds postulated that a parametrically polymorphic function is an ad-hoc polym...
Abstract. In the 1980s, John Reynolds postulated that a parametrically polymorphic function is an ad...
AbstractA polymorphic function is parametric if its behavior does not depend on the type at which it...
AbstractIn his seminal paper on “Types, Abstraction and Parametric Polymorphism,” John Reynolds call...
Parametricity is one of the foundational principles which underpin our understanding of modern progr...
AbstractThis paper focuses on how terms of the polymorphic λ-calculus, which may take types as input...
Reynolds’ theory of parametric polymorphism captures the invariance of polymorphically typed program...
In this paper we introduce a logic for parametric polymorphism. Just as LCF is a logic for the simp...
Reynolds' theory of parametric polymorphism captures the invariance of polymorphically typed program...
Reynolds' abstraction theorem has recently been extended to lambda-calculi with dependent types. In ...
AbstractWe investigate a simple form of parametricity based on adding “abstract” copies of pre-exist...
Reynolds' abstraction theorem shows how a typing judgement in System F can be translated into a rela...
Research supported by the Engineering and Physical Sciences Research Council (EP/L022478/1) and the ...
This paper combines reflexive-graph-category structure for relational parametricity with fibrational...
In the 1980s, John Reynolds postulated that a parametrically polymorphic function is an ad-hoc polym...
In the 1980s, John Reynolds postulated that a parametrically polymorphic function is an ad-hoc polym...
Abstract. In the 1980s, John Reynolds postulated that a parametrically polymorphic function is an ad...
AbstractA polymorphic function is parametric if its behavior does not depend on the type at which it...
AbstractIn his seminal paper on “Types, Abstraction and Parametric Polymorphism,” John Reynolds call...
Parametricity is one of the foundational principles which underpin our understanding of modern progr...
AbstractThis paper focuses on how terms of the polymorphic λ-calculus, which may take types as input...
Reynolds’ theory of parametric polymorphism captures the invariance of polymorphically typed program...
In this paper we introduce a logic for parametric polymorphism. Just as LCF is a logic for the simp...
Reynolds' theory of parametric polymorphism captures the invariance of polymorphically typed program...
Reynolds' abstraction theorem has recently been extended to lambda-calculi with dependent types. In ...
AbstractWe investigate a simple form of parametricity based on adding “abstract” copies of pre-exist...
Reynolds' abstraction theorem shows how a typing judgement in System F can be translated into a rela...
Research supported by the Engineering and Physical Sciences Research Council (EP/L022478/1) and the ...
This paper combines reflexive-graph-category structure for relational parametricity with fibrational...