Skip to search formSkip to main contentSkip to account menu

Parametricity

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Parametricity is an important feature of a monitoring system for making runtime verification (RV) more effective, since… 
2009
2009
We present a possible world semantics for a call-by-value higher-order programming language with impredicative polymorphism… 
2005
2005
  • Masahito Hasegawa
  • 2005
  • Corpus ID: 1718831
We study the equational theory of Parigot's second-order /spl lambda//spl mu/-calculus in connection with a call-by-name… 
Highly Cited
2004
Highly Cited
2004
Aspect-oriented programming (AOP) is a new programming paradigm whose goal is to more cleanly modularize crosscutting concerns… 
2004
2004
Aspect-oriented programming (AOP) is a new programming paradigm whose goal is to more cleanly modularize crosscutting concerns… 
Review
1997
Review
1997
The rift between imperative and functional programming is one of the oldest in computing. Imperative languages provide for… 
1995
1995
A number of lattice-theoretic fixed point rules are generalised to category theory and applied to the construction of… 
1992
1992
A polymorphic function is parametric if it has uniform behavior for all type parameters. This property is useful when writing…