Relational Parametricity for Computational Effects

Rasmus Mogelberg, Alexander Simpson

Research output: Contribution to journalArticlepeer-review


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.
Original languageEnglish
Article number7
Pages (from-to)1-31
Number of pages31
JournalLogical Methods in Computer Science
Issue number3
Publication statusPublished - 2009


Dive into the research topics of 'Relational Parametricity for Computational Effects'. Together they form a unique fingerprint.

Cite this