Informatics Report Series



Related Pages

Report (by Number) Index
Report (by Date) Index
Author Index
Institute Index

Title:Relational parametricity for computational effects
Authors: Rasmus Mogelberg ; Alexander Simpson
Date:Jul 2007
Publication Title:Proceedings 22nd Annual IEEE Symposium on Logic in Computer Science
Publication Type:Conference Paper Publication Status:Published
Page Nos:346-355
DOI:10.1109/LICS.2007.40 ISBN/ISSN:0-7695-2908-9
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. In this paper, we develop a framework for extending the notion of relational parametricity to languages with effects.
Links To Paper
No links available
Bibtex format
author = { Rasmus Mogelberg and Alexander Simpson },
title = {Relational parametricity for computational effects},
book title = {Proceedings 22nd Annual IEEE Symposium on Logic in Computer Science},
publisher = {IEEE},
year = 2007,
month = {Jul},
pages = {346-355},
doi = {10.1109/LICS.2007.40},

Home : Publications : Report 

Please mail <> with any changes or corrections.
Unless explicitly stated otherwise, all material is copyright The University of Edinburgh