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

by   Fabrizio Montesi, et al.

Initiated by Abramsky [1994], the Proofs as Processes agenda is to establish a solid foundation for the study of concurrent languages, by researching the connection between linear logic and the π-calculus. To date, Proofs as Processes is still a partial success. Caires and Pfenning [2010] showed that linear propositions correspond to session types, which prescribe the observable behaviour of processes. Further, Carbone et al. [2018] demonstrated that adopting devices from hypersequents [Avron 1991] shapes proofs such that they correspond to the expected syntactic structure of processes in the π-calculus. What remains is reconstructing the expected metatheory of session types and the π-calculus. In particular, the hallmark of session types, session fidelity, still has to be reconstructed: a correspondence between the observable behaviours of processes and their session types, in terms of labelled transitions. In this article, we present πLL, a new process calculus rooted in linear logic. The key novelty of πLL is that it comes with a carefully formulated design recipe, based on a dialgebraic view of labelled transition systems. Thanks to our recipe, πLL offers the expected transition systems of session types, which we use to establish session fidelity. We use πLL to carry out the first thorough investigation of the metatheoretical properties enforced by linear logic on the observable behaviour of processes, uncovering connections with similarity and bisimilarity. We also prove that πLL and our recipe form a robust basis for the further exploration of Proofs as Processes, by considering different features: polymorphism, process mobility, and recursion.


page 1

page 2

page 3

page 4


Circular Proofs as Session-Typed Processes: A Local Validity Condition

Proof theory provides a foundation for studying and reasoning about prog...

A subexponential view of domains in session types

Linear logic (LL) has inspired the design of many computational systems,...

Better Late Than Never: A Fully Abstract Semantics for Classical Processes

We present Hypersequent Classical Processes (HCP), a revised interpretat...

On Session Typing, Probabilistic Polynomial Time, and Cryptographic Experiments (Long Version)

A system of session types is introduced as induced by a Curry Howard cor...

Synchronous Forwarders

Session types are types for specifying protocols that processes must fol...

Classical Transitions

We introduce the calculus of Classical Transitions (CT), which extends t...

Functions as Processes: The Case of Collapsing Non-determinism

This paper studies typed translations of λ-calculi into π-calculi, both ...

Please sign up or login with your details

Forgot password? Click here to reset