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)

Related topics

Related topics

9 relations
Ad hoc polymorphismChurch encodingF-algebraInitial algebra

Broader (1)

Type theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Verification of Information Flow and Access Control Policies with Dependent Types
We present Relational Hoare Type Theory (RHTT), a novel language and verification system capable of expressing and verifying rich… 
Highly Cited
2010
Highly Cited
2010
PARAM: A Model Checker for Parametric Markov Models
We present PARAM 1.0, a model checker for parametric discrete-time Markov chains (PMCs) PARAM can evaluate temporal properties of… 
2010
2010
Haskell Type Constraints Unleashed
The popular Glasgow Haskell Compiler extends the Haskell 98 type system with several powerful features, leading to an expressive… 
2009
2009
A Step-indexed Semantics of Imperative Objects
Step-indexed semantic interpretations of types were proposed as an alternative to purely syntactic proofs of type safety using… 
2007
2007
Syntactic Logical Relations for Polymorphic and Recursive Types
Highly Cited
2006
Highly Cited
2006
Testing, abstraction, theorem proving: better together!
We present a method for static program analysis that leverages tests and concrete program executions. State abstractions… 
Highly Cited
2004
Highly Cited
2004
Open Modules: A Proposal for Modular Reasoning in Aspect-Oriented Programming
Aspect-oriented programming (AOP) is a new programming paradigm whose goal is to more cleanly modularize crosscutting concerns… 
1995
1995
Categorical Fixed Point Calculus
A number of lattice-theoretic fixed point rules are generalised to category theory and applied to the construction of… 
1994
1994
Subtyping and parametricity
We study the interaction of subtyping and parametricity. We describe a logic for a programming language with parametric… 
Highly Cited
1993
Highly Cited
1993
Linear Logic, Coherence, and Dinaturality
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)