Conflation confers concurrency

Robert Atkey, Sam Lindley, J. Garrett Morris

Research output: Chapter in Book/Report/Conference proceedingChapter

13 Citations (Scopus)
48 Downloads (Pure)


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
Number of pages24
ISBN (Print)9783319309354
Publication statusPublished - 28 Apr 2016

Publication series

NameLecture Notes in Computer Science


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

Cite this