Blogs (1) >>
POPL 2019
Sun 13 - Sat 19 January 2019 Cascais, Portugal
Sun 13 Jan 2019 09:50 - 10:10 at Sala VII - Session 1 Chair(s): Philip Wadler

Context-free session types were proposed as an extension of session types able to capture the type-safe serialization of recursive datatypes. For the sake of a practical usage, namely in the definition of new programming languages, there is an urgent need for an algorithm to decide type equivalence. In this work, we propose an algorithm to decide type equivalence on context-free session types. Based on the construction we followed and on the tests we ran to validate the algorithm, we expect the algorithm to be sound and complete.

Sun 13 Jan

Displayed time zone: Belfast change

08:30 - 10:30
Session 1BEAT at Sala VII
Chair(s): Philip Wadler University of Edinburgh, UK
08:30
10m
Day opening
Opening
BEAT
Antonio Ravara Department of Informatics, Faculty of Sciences and Technology, NOVA University of Lisbon and NOVA LINCS, Jorge A. Pérez University of Groningen, The Netherlands
08:40
50m
Talk
Invited Talk: Gradual Session Types — an Ongoing Journey
BEAT
Peter Thiemann University of Freiburg, Germany
09:30
20m
Talk
Gradual Session Types in Imperative Style
BEAT
Kaede Kobayashi Kyoto University, Atsushi Igarashi Kyoto University, Japan
09:50
20m
Talk
Checking the Equivalence of Context-Free Session Types
BEAT
Andreia Mordido Lasige / Faculty of Sciences, Universidade de Lisboa, Vasco Vasconcelos LASIGE, Faculty of Sciences, University of Lisbon
File Attached
10:10
20m
Talk
Effpi: Concurrent Programming with Dependent Behavioural Types
BEAT
Alceste Scalas Imperial College London, Elias Benussi Imperial College London, Nobuko Yoshida Imperial College London
File Attached