COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Logic and Semantics Seminar (Computer Laboratory) > Relational parametricity for computational effects.

## Relational parametricity for computational effects.Add to your list(s) Download to your calendar using vCal - Rasmus Møgelberg, Edinburgh
- Friday 16 March 2007, 14:00-15:00
- FW11.
If you have a question about this talk, please contact Matthew Parkinson. 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. Real programs, however, exhibit computational effects. In this paper, we develop a framework for extending the notion of relational parametricity to languages with effects. This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series. ## This talk is included in these lists:- All Talks (aka the CURE list)
- Computer Laboratory talks
- Computing and Mathematics
- FW11
- Logic and Semantics Seminar (Computer Laboratory)
- School of Technology
Note that ex-directory lists are not shown. |
## Other listsChemSoc - Cambridge Chemistry Society Theoretical Chemistry Informal Seminars Grames for the Brain## Other talksApplications and extensions. Short Course: Higher order regularisation in imaging - Lecture 3 Kidney cancer: the most lethal urological malignancy Celebrating 10 Years of Cambridge Global Health Partnerships Quaternary Discussion Group seminar Knowing numbers, counting men: paper technology and manpower in the eighteenth century Cancer immunotherapy |