POPL 2019 (series) / BEAT 2019 (series) / BEAT 2019: Fourth Workshop on Behavioral Types /
Checking the Equivalence of Context-Free Session Types
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.
slides (MordidoVasconcelos_BEAT19.pdf) | 1.38MiB |
Sun 13 Jan Times are displayed in time zone: Greenwich Mean Time : Belfast change
Sun 13 Jan
Times are displayed in time zone: Greenwich Mean Time : Belfast change
08:30 - 08:40 Day opening | Opening BEAT Antonio RavaraDepartment of Informatics, Faculty of Sciences and Technology, NOVA University of Lisbon and NOVA LINCS, Jorge A. PérezUniversity of Groningen, The Netherlands | ||
08:40 - 09:30 Talk | Invited Talk: Gradual Session Types — an Ongoing Journey BEAT Peter ThiemannUniversity of Freiburg, Germany | ||
09:30 - 09:50 Talk | Gradual Session Types in Imperative Style BEAT | ||
09:50 - 10:10 Talk | Checking the Equivalence of Context-Free Session Types BEAT Andreia MordidoLasige / Faculty of Sciences, Universidade de Lisboa, Vasco VasconcelosLASIGE, Faculty of Sciences, University of Lisbon File Attached | ||
10:10 - 10:30 Talk | Effpi: Concurrent Programming with Dependent Behavioural Types BEAT Alceste ScalasImperial College London, Elias BenussiImperial College London, Nobuko YoshidaImperial College London File Attached |