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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
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
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
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
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
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
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
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
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
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
A semantic condition necessary for the parametricity of polymorphic functions is considered. One of its instances is the… (More)
Is this relevant?