Rasmus Ejlers Møgelberg ; Alex Simpson - Relational Parametricity for Computational Effects

lmcs:1113 - Logical Methods in Computer Science, August 9, 2009, Volume 5, Issue 3 - https://doi.org/10.2168/LMCS-5(3:7)2009
Relational Parametricity for Computational Effects

Authors: Rasmus Ejlers Møgelberg ; Alex Simpson

According to Strachey, a polymorphic program is parametric if it applies a uniform algorithm independently of the type instantiations at which it is applied. The notion of relational parametricity, introduced by Reynolds, is one possible mathematical formulation of this idea. Relational parametricity provides a powerful tool for establishing data abstraction properties, proving equivalences of datatypes, and establishing equalities of programs. Such properties have been well studied in a pure functional setting. Many programs, however, exhibit computational effects, and are not accounted for by the standard theory of relational parametricity. In this paper, we develop a foundational framework for extending the notion of relational parametricity to programming languages with effects.

Volume: Volume 5, Issue 3
Published on: August 9, 2009
Accepted on: June 25, 2015
Submitted on: July 16, 2008
Keywords: Computer Science - Programming Languages,Computer Science - Logic in Computer Science,F.3.2,D.3.3


Consultation statistics

This page has been seen 601 times.
This article's PDF has been downloaded 340 times.