University of Cambridge > Talks.cam > Microsoft Research Cambridge, public talks > Realizability and Parametricity in Pure Type Systems: An application

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Realizability and Parametricity in Pure Type Systems: An application

Download to your calendar using vCal

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins .

We describe a systematic method to build a logic from any programming language described as a Pure Type System (PTS). The formulas of this logic express properties about programs. We define a parametricity theory about programs and a realizability theory for the logic. The logic is expressive enough to internalize both theories. Thanks to the PTS setting, we abstract most idiosyncrasies specific to particular type theories. This confers generality to the results, and reveals parallels between parametricity and realizability. The red-thread of the talk will be a possible implication on the design of programming languages featuring dependent types.

This talk is part of the Microsoft Research Cambridge, public talks series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Lewin Stroke & Rehabilitation Unit, Seminar Room, R2, Addenbrooke's Hospital Adrian House, Trinity College (Grange Road, Cambridge) Rayleigh room, Maxwell Centre, JJ Thomson Ave, Cambridge CB3 0HE

Other talks

The Play Paradox: How video games build better humans Novel neuroimaging methods in Lewy body dementia Title to be confirmed On convective penetration of a buoyant plume into a stably stratified layer Why people with schizophrenia die earlier? Mortality and accelerated ageing Group Work
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity