Manifest sharing with session types

Abstract

Session-typed languages building on the Curry-Howard isomorphism between linear logic and session-typed communication guarantee session fidelity and deadlock freedom. Unfortunately, these strong guarantees exclude many naturally occurring programming patterns pertaining to shared resources. In this paper, we introduce sharing into a session-typed language where types are stratified into linear and shared layers with modal operators connecting the layers. The resulting language retains session fidelity but not the absence of deadlocks, which can arise from contention for shared processes. We illustrate our language on various examples, such as the dining philosophers problem, and provide a translation of the untyped asynchronous π-calculus into our language.

Multiparty Classical Choreographies

“…The calculus of classical higher-order processes [18] could be of inspiration for adding code mobility to MCC, by adding higher-order types. Types for manifest sharing in [2] may lead us to global specifications of sharing in choreographies. And the asynchronous interpretation of cut reductions in [12] might give us an asynchronous implementation of choreographies in MCC.…”

A Message-Passing Interpretation of Adjoint Logic

“…Separating Figure 1: Process Assignment for Asynchronous Adjoint Logic m from σ (m) allows us to have multiple modes with the same set of structural properties. 1 No matter which structural properties are available for a channel, each active channel will still have exactly one provider. Beyond that, a channel x m with W ∈ σ (m) may not have any clients.…”

FreeST: Context-free Session Types in a Functional Language

“…Shared channels allow for multiple readers and multiple writers, thus introducing (benign) races. There are several proposals in the literature [3,8,15,25] on which we may base this extension. The dualof type operator is present in the SePi language [8]; we plan its incorporation in FREEST language.…”

“…SILL is a functional language with session typed concurrency, based on the Curry-Howard interpretation of intuitionistic linear logic [4], further extended with recursive types and processes [23,24]. C1 is an imperative language [18] developed along the lines of SILL, featuring types that express sharing [3]. All these languages use regular session types.…”