Polymorphic lambda calculus with context-free session types

Session types provide a typing discipline for structured communication on bidirectional channels. Context-free session types overcome the restriction to tail recursive protocols characteristic of conventional session types. This extension enables the serialization and deserialization of tree structu...

Full description

Saved in:

Bibliographic Details
Published in:	Information and computation Vol. 289; p. 104948
Main Authors:	Almeida, Bernardo, Mordido, Andreia, Thiemann, Peter, Vasconcelos, Vasco T.
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.11.2022
Subjects:	Context-free types Functional programming Polymorphism Session types Context-free types Functional programming Session types Polymorphism
ISSN:	0890-5401, 1090-2651
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	Session types provide a typing discipline for structured communication on bidirectional channels. Context-free session types overcome the restriction to tail recursive protocols characteristic of conventional session types. This extension enables the serialization and deserialization 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 kinding system to distinguish message types, session types, and channel types. The system presents 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 typing preservation, progress, and a characterization of erroneous processes.
ISSN:	0890-5401 1090-2651
DOI:	10.1016/j.ic.2022.104948