University of Cambridge > Talks.cam > Semantics Lunch (Computer Laboratory) > Some notes on syntactic logical relations for pure System F

Some notes on syntactic logical relations for pure System F

Add to your list(s) Download to your calendar using vCal

  • UserDimitrios Vytiniotis, MSR
  • ClockMonday 10 November 2008, 12:45-14:00
  • HouseFW26.

If you have a question about this talk, please contact Matthew Parkinson.

In this talk I will describe various notions of syntactic logical relations for pure System F without recursion. I will then attempt to connect these relations to various notions of bisimulation and observational equivalence. It turns out that even in this simple setting the connection of these logical relations to observational equivalence is not obvious; and I will be explaining the complications and some ideas to solve this problem. There are few novel results in this talk so this is mainly a call for discussion on ways forward.

This talk is part of the Semantics Lunch (Computer Laboratory) series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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