University of Birmingham > Talks@bham > Theoretical computer science seminar > Constructing fully-abstract models of effectful λ-calculi

Constructing fully-abstract models of effectful λ-calculi

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

If you have a question about this talk, please contact Paul Levy.

Adequacy and full abstraction are akin to soundness and completeness in logic: a semantic model is adequate and fully abstract if semantic equality in the model completely characterises contextual equivalence. Typically one can establish adequacy by a logical relations argument, but full abstraction proves to be much more difficult: even basic set-theoretic models of simple languages fail to be fully abstract.

In this talk I will outline a construction which takes a categorical model of Moggi’s computational lambda calculus with primitives and sum types and, subject to certain conditions on the base category, returns an adequate and fully abstract model. Along the way I will sketch the intuition, motivate the main steps in the construction, and indicate the mathematical technologies that make the construction work.

Joint work with Ohad Kammar and Shin-ya Katsumata

This talk is part of the Theoretical computer science seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.