Logical time is a partial order over events in distributed systems, constraining which events
precede others. Special interest has been given to series-parallel orders since they …

The Functional Machine Calculus (FMC) was recently introduced as a generalization of the
lambda-calculus to include higher-order global state, probabilistic and non-deterministic …

In this paper we present a proof system that operates on graphs instead of formulas. We
begin our quest with the well-known correspondence between formulas and cographs …

An explicit-sharing lambda-calculus is presented, based on a Curry-Howard-style
interpretation of the deep inference proof formalism. Duplication of subterms during …

This book takes an idea first explored by medieval logicians 800 years ago and revisits it
armed with the tools of contemporary linguistics, logic, and computer science. The idea-the …

The course will give a basic introduction to deep inference, which is a design principle for
proof formalisms in which inference rules can be applied at any depth inside the proof. In …

The sequent calculus is often criticized for requiring proofs to contain large amounts of low-
level syntactic details that can obscure the essence of a given proof. Because each …

System NEL is the mixed commutative/non-commutative linear logic BV augmented with
linear logic's exponentials, or, equivalently, it is MELL augmented with the non-commutative …

The Spirit of Node Replication. Page 358 The Spirit of Node Replication Delia Kesner1 , 2, Loıc
Peyrot 1, and Daniel Ventura3 ⋆ 1 Université de Paris, CNRS, IRIF, Paris, France { kesner …

In this paper we present a proof system that operates on graphs instead of formulas. Starting
from the well-known relationship between formulas and cographs, we drop the cograph …