Relational Parametricity for Computational Effects

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 ion properties, proving equivalences of datatypes, and establishing equalities of programs. Such properties have been well studied in a pure functional setting. Real programs, however, exhibit computational effects. In this paper, we develop a framework for extending the notion of relational parametricity to languages with effects.

• Type: Conference
• Year: 2007
• Where: LICS
• Authors: Rasmus Ejlers Møgelberg, Alex Simpson
• Keywords: Computer Science, Data Ion Properties, LICS 2007, Possible Mathematical Formulation, Relational Parametricity