Isomorphism of types in presence of higher-order store

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

• Pierre Clairambault, University of Bath
• Friday 12 November 2010, 16:00-17:00
• UG40 Computer Science.

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

We recall the functional programming language L with higher-order store introduced by Abramsky, Honda and McCusker along with its games model, and define the problem of type isomorphisms on L. We also recall Laurent’s characterisation of isomorphisms in the category of arenas and visible strategies as geometric correspondences between arenas. Solving an open problem by Laurent, we show that a significant part of his result still holds in the non-visible setting. This allows us to give a characterisation of isomorphisms of types in L.

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

This talk is included in these lists:

• Computer Science Departmental Series
• Computer Science Distinguished Seminars
• Theoretical computer science seminar
• UG40 Computer Science
• computer sience

Note that ex-directory lists are not shown.