Minimal Session Types for the π-calculus

Alen Arslanagic, Amelia Palamariuc, Jorge A. Pérez

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

1 Citation (Scopus)
7 Downloads (Pure)

Abstract

Session types enable the static verification of message-passing programs. A session type specifies a channel’s protocol as sequences of messages. Prior work established a minimality result: every process typable with standard session types can be compiled down to a process typable using minimal session types: session types without the sequencing construct. This result justifies session types in terms of themselves; it holds for a higher-order session π-calculus, where values are abstractions (functions from names to processes).

This paper establishes a new minimality result but now for the session π-calculus, the language in which values are names and for which session types have been more widely studied. Remarkably, this new minimality result can be obtained by composing known results. We develop optimizations of our new minimality result, and establish its static and dynamic correctness.
Original languageEnglish
Title of host publicationPPDP 2021
Subtitle of host publication23rd International Symposium on Principles and Practice of Declarative Programming
EditorsNiccolò Veltri, Nick Benton, Silvia Ghilezan
Place of PublicationNew York
PublisherAssociation for Computing Machinery
Number of pages15
ISBN (Print)978-1-4503-8689-0
DOIs
Publication statusPublished - 6-Sep-2021
EventPPDP 2021: 23rd International Symposium on Principles and Practice of Declarative Programming -
Duration: 6-Sep-20218-Sep-2021

Conference

ConferencePPDP 2021: 23rd International Symposium on Principles and Practice of Declarative Programming
Period06/09/202108/09/2021

Cite this