Context-Free Session Types for Applied Pi-Calculus

Aagaard, Jens; Hüttel, Hans; Jakobsen, Mathias; Kettunen, Mikkel Klinke

doi:10.4204/eptcs.276.3

Cited by 2 publications

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As a consequence, there are basic equivalences on types that Padovani's compiler is not able to identify. Aagaard et al [1] introduce the concept of context-free session types to the applied pi calculus. They also account for unrestricted (that is, arbitrarily shared) channels in the style of Vasconcelos [58], a feature that we decided not to include in this paper.…”

Section: Soundness (Synthesis)mentioning

confidence: 99%

Polymorphic Lambda Calculus with Context-Free Session Types

Almeida¹,

Mordido²,

Thiemann³

et al. 2021

Preprint

View full text Add to dashboard Cite

Context-free session types provide a typing discipline for recursive structured communication protocols on bidirectional channels. They overcome the restriction of regular session type systems to tail recursive protocols. This extension enables us to implement serialisation and deserialisation of tree structures in a fully type-safe manner.We present the theory underlying the language FreeST 2, which features context-free session types in an extension of System F with linear types and a kind system to distinguish message types and channel types. The system presents some metatheoretical challenges, which we address, contractivity in the presence of polymorphism, a non-trivial equational theory on types, and decidability of type equivalence. We also establish standard results on type preservation, progress, and a characterisation of erroneous processes.

show abstract

Section: Soundness (Synthesis)mentioning

confidence: 99%