The deep symmetry of linear logic [18] makes it suitable for providing abstract models of
computation, free from implementation details which are, by nature, oriented and non …

The Curry-Howard isomorphism states an amazing correspondence between systems of
formal logic as encountered in proof theory and computational calculi as found in type …

We formulate a typed formalism for concurrency where types denote freely composable
structure of dyadic interaction in the symmetric scheme. The resulting calculus is a typed …

We introduce a logic BI in which a multiplicative (or linear) and an additive (or intuitionistic)
implication live side-by-side. The propositional version of BI arises from an analysis of the …

We present a new model, based on monads, for performing input/output in a non-strict,
purely functional language. It is composable, extensible, efficient, requires no extensions to …

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 …

Several type disciplines for π-calculi have been proposed in which linearity plays a key role,
even if their precise relationship with pure linear logic is still not well understood. In this …

How can we integrate interaction into a purely declarative language? This tutorial describes
a solution to this problem based on a monad. The solution has been implemented in the …

When logic programming is based on the proof theory of intuitionistic logic, it is natural to
allow implications in goals and in the bodies of clauses. Attempting to prove a goal of the …

Propositions as types Page 1 DECEMBER 2015 | VOL. 58 | NO. 12 | COMMUNICATIONS OF
THE ACM 75 DOI:10.1145/2699407 Connecting mathematical logic and computation, it …