FAQ

Parametricity

Known as: Abstraction theorem 
In programming language theory, parametricity is an abstract uniformity property enjoyed by parametrically polymorphic functions, which captures the… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1988-2017
0102019882017

Related topics

Related topics

9 relations
Ad hoc polymorphismChurch encodingF-algebraInitial algebra
(More)

Related mentions per year

Related mentions per year

1938-2018
19401960198020002020
Parametricity
Type theory
Program transformation
Lazy evaluation
Parametric polymorphism
Initial algebra

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Parametricity and dependent types
Reynolds' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second… (More)
  • figure 6
Is this relevant?
2010
2010
Parametricity, type equality, and higher-order polymorphism
Propositions that express type equality are a frequent ingredient of modern functional programming—they can encode generic… (More)
  • figure 3
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
2009
2009
Non-parametric parametricity
Type abstraction and intensional type analysis are features seemingly at odds-type abstraction is intended to guarantee… (More)
  • figure 2
  • figure 3
  • figure 6
  • figure 7
Is this relevant?
2007
2007
Relational Parametricity and Separation Logic
Separation logic is a recent extension of Hoare logic for reasoning about programs with references to shared mutable data… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 6
  • figure 7
Is this relevant?
2005
2005
Generalizing parametricity using information-flow
Run-time type analysis allows programmers to easily and concisely define operations based upon type structure, such as… (More)
  • figure 1
Is this relevant?
2004
2004
Translating dependency into parametricity
Abadi et al. introduced the <i>dependency core calculus</i> (DCC) as a unifying framework to study many important program… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Parametric polymorphism and operational equivalence
Studies of the mathematical properties of impredicative polymorphic types have for the most part focused on the polymorphic… (More)
  • figure 1
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Parametricity and Local Variables
We propose that the phenomenon of local state may be understood in terms of Strachey's concept of parametric (i.e., uniform… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
A Logic for Parametric Polymorphism
In this paper we introduce a logic for parametric polymorphism. Just as LCF is a logic for the simply-typed -calculus with… (More)
Is this relevant?
1988
1988
Semantic parametricity in polymorphic lambda calculus
A semantic condition necessary for the parametricity of polymorphic functions is considered. One of its instances is the… (More)
Is this relevant?