University of Birmingham > Talks@bham > Theoretical computer science seminar > Two Sides of the Same Coin: Session Types and Game Semantics

## Two Sides of the Same Coin: Session Types and Game SemanticsAdd to your list(s) Download to your calendar using vCal - Simon Castellan, Imperial College London
- Friday 24 May 2019, 11:00-12:00
- Computer Science, The Sloman Lounge (UG).
If you have a question about this talk, please contact Noam Zeilberger. Game semantics and session types are two formalisations of the same concept: message-passing open programs following certain protocols. Game semantics represents protocols as games, and programs as strategies; while session types specify protocols, and well-typed π-calculus processes model programs. Giving faithful models of the π-calculus and giving a precise description of strategies as a programming language are two difficult problems. In this talk, we show how these two problems can be tackled at the same time by building an accurate game semantics model of the session π-calculus. Our main contribution is to fill a semantic gap between the synchrony of the (session) π-calculus and the asynchrony of game semantics, by developing an event-structure based game semantics for synchronous concurrent computation. This model supports the first truly concurrent fully abstract (for barbed congruence) interpretation of the synchronous (session) π-calculus. We further strengthen this correspondence, establishing finite definability of asynchronous strategies by the internal session π-calculus. As an application of these results, we propose a faithful encoding of synchronous strategies into asynchronous strategies by call-return protocols, which induces automatically an encoding at the level of processes. Our results bring session types and game semantics into the same picture, proposing the session calculus as a programming language for strategies, and strategies as a very accurate model of the session calculus. We implement a prototype which computes the interpretation of session processes as synchronous strategies. 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
- Computer Science, The Sloman Lounge (UG)
- Theoretical computer science seminar
- computer sience
Note that ex-directory lists are not shown. |
## Other listsLab Lunch Centre for Computational Biology Seminar Series Combinatorics and Probability Seminar## Other talksPerfect matchings in random sparsifications of Dirac hypergraphs Hodge Theory: Connecting Algebra and Analysis Modelling uncertainty in image analysis. Geometry of alternating projections in metric spaces with bounded curvature The development of an optically pumped magnetometer based MEG system TBC |