Conflation confers concurrency

Research output: ResearchChapter

Session types provide a static guarantee that concurrent programs respect communication protocols. Recent work has explored a correspondence between proof rules and cut reduction in linear logic and typing and evaluation of process calculi. This paper considers two approaches to extend logically-founded process calculi. First, we consider extensions of the process calculus to more closely resemble π-calculus. Second, inspired by denotational models of process calculi, we consider conflating dual types. Most interestingly, we observe that these approaches coincide: conflating the multiplicatives (⊗ and 
⅋) allows processes to share multiple channels; conflating the additives (⊕ and &) provides nondeterminism; and conflating the exponentials (! and ?) yields access points, a rendezvous mechanism for initiating session typed communication. Access points are particularly expressive: for example, they are sufficient to encode concurrent state and general recursion.
Original languageEnglish
Title of host publicationA List of Successes That Can Change the World
Subtitle of host publicationEssays Dedicated to Philip Wadler on the Occasion of His 60th Birthday
EditorsSam Lindley, Conor McBride, Phil Trinder, Don Sannella
PublisherSpringer
Pages32-55
Number of pages24
Volume9600
ISBN (Print)9783319309354
DOIs
StatePublished - 28 Apr 2016

Publication series

NameLecture Notes in Computer Science
PublisherSpringer

    Research areas

  • proof rules, cut reduction, linear logic, process calculi

Bibliographical note

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-30936-1_2

View graph of relations