Session types statically guarantee that communication complies with a protocol. However,
most accounts of session typing do not account for failure, which means they are of limited …

The π π-calculus, viewed as a core concurrent programming language, has been used as
the target of much research on type systems for concurrency. In this paper we propose a …

Session types enable the specification and verification of communicating systems. However,
their theory often assumes that processes never fail. To address this limitation, we present a …

We introduce CLASS, a session-typed, higher-order, core language that supports concurrent
computation with shared linear state. We believe that CLASS is the first proposal for a …

The emergence of propositions-as-sessions, a Curry-Howard correspondence between
propositions of Linear Logic and session types for concurrent processes, has settled the …

We present Hypersequent Classical Processes (HCP), a revised interpretation of the “Proofs
as Processes” correspondence between linear logic and the π-calculus initially proposed by …

We present a system of session types based on adjoint logic which generalizes standard
binary session types. Our system allows us to uniformly capture several new behaviors in …

We develop a principled integration of shared mutable state into a proposition-as-types
linear logic interpretation of a session-based concurrent programming language. While the …

We introduce coexponentials, a new set of modalities for Classical Linear Logic. As duals to
exponentials, the coexponentials codify a distributed form of the structural rules of …

Ubiquitous connectivity of web, mobile, and IoT computing platforms has fostered a variety of
distributed applications with decentralized state. These applications execute across multiple …