Rig categories with finite biproducts are categories with two monoidal products, where one
is a biproduct and the other distributes over it. In this work we present tape diagrams, a …

Handsome proof nets were introduced by Retor\'e as a syntax for multiplicative linear logic.
These proof nets are defined by means of cographs (graphs representing formulas) …

In this paper we investigate the Curry-Howard correspondence for constructive modal logic
in light of the gap between the proof equivalences enforced by the lambda calculi from the …

In this paper we investigate the Curry-Howard-Lambek correspondence for constructive
modal logic in light of the gap between the proof equivalences enforced by the lambda …

Linear logic was conceived in 1987 by Girard and, in contrast to classical logic, restricts the
usage of the structural inference rules of weakening and contraction. With this, atoms of the …

Using the tools developed to formalize combinatorial proofs for modal logic, in this paper we
extend Retoré's handsome proof nets to multiplicative linear logic with units and …

In this presentation we show how the sequent calculus formalism can be replaced by an
alternative 2-dimensional version: proof diagrams. Proof diagrams are particular kind of …