Relational Parametricity for Computational Effects

Details Relational Parametricity for Computational Effects Relational Parametricity for Computational Effects

2009-06-30

arxiv.org/abs/0906.5488v2

Computer Science

Programming Languages

31 pages, appears in Logical Methods in Computer Science

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Relational Parametricity for Computational Effects does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Relational Parametricity for Computational Effects, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Relational Parametricity for Computational Effects will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-440803