A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf
.
Relational Parametricity for Computational Effects
2007
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)
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
doi:10.1109/lics.2007.40
dblp:conf/lics/MogelbergS07
fatcat:knyapdfuarbhddxx73wxbdljky