Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and
Pfenning (2010), among others, this paper presents CP, a calculus in which propositions of …

Session types are a formalism to model structured communication-based programming. A
session type describes communication by specifying the type and direction of data …

Choreographies are descriptions of distributed systems where the developer gives a global
view of how messages are exchanged by endpoint nodes (endpoints for short), instead of …

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

Compiler correctness proofs for higher-order concurrent languages are difficult: they involve
establishing a termination-preserving refinement between a concurrent high-level source …

We investigate a notion of behavioral genericity in the context of session type disciplines. To
this end, we develop a logically motivated theory of parametric polymorphism, reminiscent of …

Mainstream programming idioms intensively rely on state mutation, sharing, and
concurrency. Designing type systems for handling and disciplining such idioms is …

Subty** in concurrency has been extensively studied since early 1990s as one of the most
interesting issues in type theory. The correctness of subty** relations has been usually …

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 …

Prior work has shown that intuitionistic linear logic can be seen as a session-type discipline
for the π-calculus, where cut reduction in the sequent calculus corresponds to synchronous …