Machine-checked semantic session typing

Machine-checked semantic session typing

Hinrichsen, Jonas Kastberg (University of Copenhagen)
Louwrink, Daniël (Universiteit van Amsterdam)
Krebbers, R.J. (TU Delft Programming Languages; Radboud Universiteit Nijmegen)
Bengtson, Jesper (University of Copenhagen)

Hritcu, Catalin (editor)
Popescu, Andrei (editor)

2021

Session types- A family of type systems for message-passing concurrency-have been subject to many extensions, where each extension comes with a separate proof of type safety. These extensions cannot be readily combined, and their proofs of type safety are generally not machine checked, making their correctness less trustworthy. We overcome these shortcomings with a semantic approach to binary asynchronous affine session types, by developing a logical relations model in Coq using the Iris program logic. We demonstrate the power of our approach by combining various forms of polymorphism and recursion, asynchronous subtyping, references, and locks/mutexes. As an additional benefit of the semantic approach, we demonstrate how to manually prove typing judgements of racy, but safe, programs that cannot be type checked using only the rules of the type system.

Concurrency
Coq
Iris
Message passing
Semantic typing
Separation logic
Session types

http://resolver.tudelft.nl/uuid:9e66cf2e-d6bc-4f5f-bf72-02f7c2e15e0e

https://doi.org/10.1145/3437992.3439914

Association for Computing Machinery (ACM)

9781450382991

CPP 2021 - Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs, co-located with POPL 2021

10th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2021, co-located with POPL 2021, 2021-01-17 → 2021-01-19, Virtual, Online, Denmark

CPP 2021 - Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs, co-located with POPL 2021

Institutional Repository

conference paper

© 2021 Jonas Kastberg Hinrichsen, Daniël Louwrink, R.J. Krebbers, Jesper Bengtson