A subexponential view of domains in session types

by   Daniele Nantes, et al.

Linear logic (LL) has inspired the design of many computational systems, offering reasoning techniques built on top of its meta-theory. Since its inception, several connections between concurrent systems and LL have emerged from different perspectives. In the last decade, the seminal work of Caires and Pfenning showed that formulas in LL can be interpreted as session types and processes in the π-calculus as proof terms. This leads to a Curry-Howard interpretation where proof reductions in the cut-elimination procedure correspond to process reductions/interactions. The subexponentials in LL have also played an important role in concurrent systems since they can be interpreted in different ways, including timed, spatial and even epistemic modalities in distributed systems. In this paper we address the question: What is the meaning of the subexponentials from the point of view of a session type interpretation? Our answer is a π-like process calculus where agents reside in locations/sites and they make it explicit how the communication among the different sites should happen. The design of this language relies completely on the proof theory of the subexponentials in LL, thus extending the Caires-Pfenning interpretation in an elegant way.


page 1

page 2

page 3

page 4


Linear Logic, the π-calculus, and their Metatheory: A Recipe for Proofs as Processes

Initiated by Abramsky [1994], the Proofs as Processes agenda is to estab...

On Polymorphic Sessions and Functions: A Tale of Two (Fully Abstract) Encodings

This work exploits the logical foundation of session types to determine ...

A Bunch of Sessions: A Propositions-as-Sessions Interpretation of Bunched Implications in Channel-Based Concurrency

The emergence of propositions-as-sessions, a Curry-Howard correspondence...

On the Fair Termination of Client-Server Sessions

Client-server sessions are based on a variation of the traditional inter...

An intensionally fully-abstract sheaf model for π (expanded version)

Following previous work on CCS, we propose a compositional model for the...

Multirole Logic and Multiparty Channels

We identify multirole logic as a new form of logic in which conjunction/...

Sized Types with Usages for Parallel Complexity of Pi-Calculus Processes

We address the problem of analysing the complexity of concurrent program...

Please sign up or login with your details

Forgot password? Click here to reset