BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Relational parametricity for computational effects. - Rasmus Møge
 lberg\, Edinburgh
DTSTART:20070316T140000Z
DTEND:20070316T150000Z
UID:TALK6527@talks.cam.ac.uk
CONTACT:Matthew Parkinson
DESCRIPTION:According to Strachey\, a polymorphic program is parametric if
  it applies\na uniform algorithm independently of the type instantiations\
 nat which it is applied. The notion of relational parametricity\, introduc
 ed\nby Reynolds\, is one possible mathematical formulation of this idea.\n
 Relational parametricity provides a powerful tool for establishing data\na
 bstraction properties\, proving equivalences of datatypes\, and establishi
 ng\nequalities of programs. Such properties have been well studied in a pu
 re\nfunctional setting. Real programs\, however\, exhibit computational\ne
 ffects. In this paper\, we develop a framework for extending the notion of
 \nrelational parametricity to languages with effects.\n
LOCATION:FW11
END:VEVENT
END:VCALENDAR