DeepAI AI Chat
Log In Sign Up

Coherent Interaction Graphs

by   Lê Thành Dũng Nguyên, et al.
Université Paris 13

We introduce the notion of coherent graphs, and show how those can be used to define dynamic semantics for Multiplicative Linear Logic (MLL) extended with non-determinism. Thanks to the use of a coherence relation rather than mere formal sums of non-deterministic possibilities, our model enjoys some finiteness and sparsity properties. We also show how studying the semantic types generated by a single "test" within our model of MLL naturally gives rise to a notion of proof net, which turns out to be exactly Retoré's R&B-cographs. This revisits the old idea that multplicative proof net correctness is interactive, with a twist: types are characterized not by a set of counter-proofs but by a single non-deterministic counter-proof.


page 1

page 2

page 3

page 4


Proof nets, coends and the Yoneda isomorphism

Proof nets provide permutation-independent representations of proofs and...

Taylor expansion in linear logic is invertible

Each Multiplicative Exponential Linear Logic (MELL) proof-net can be exp...

Monadicity of Non-deterministic Logical Matrices is Undecidable

The notion of non-deterministic logical matrix (where connectives are in...

Complementation: a bridge between finite and infinite proofs

When a proposition has no proof in an inference system, it is sometimes ...

Stellar Resolution: Multiplicatives

We present a new asynchronous model of computation named Stellar Resolut...

Multiplicative linear logic from a resolution-based tile system

We present the stellar resolution, a "flexible" tile system based on Rob...

A Deforestation of Reducts: Refocusing

In a small-step semantics with a deterministic reduction strategy, refoc...