Loading [a11y]/accessibility-menu.js
Relational Parametricity for Computational Effects | IEEE Conference Publication | IEEE Xplore

Relational Parametricity for Computational Effects


Abstract:

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 o...Show More

Abstract:

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.
Date of Conference: 10-14 July 2007
Date Added to IEEE Xplore: 23 July 2007
Print ISBN:0-7695-2908-9
Print ISSN: 1043-6871
Conference Location: Wroclaw, Poland

Contact IEEE to Subscribe

References

References is not available for this document.