Interpreting a concurrent λ-calculus in differential proof nets (extended version)

by   Yann Hamdaoui, et al.

In this paper, we show how to interpret a language featuring concurrency, references and replication into proof nets, which correspond to a fragment of differential linear logic. We prove a simulation and adequacy theorem. A key element in our translation are routing areas, a family of nets used to implement communication primitives which we define and study in detail.


page 1

page 2

page 3

page 4


Taylor expansion in linear logic is invertible

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

Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets

We prove that (strong) fully-concurrent bisimilarity and causal-net bisi...

Neural Proof Nets

Linear logic and the linear λ-calculus have a long standing tradition in...

Proof nets through the lens of graph theory: a compilation of remarks

This document is intended to eventually gather a few small remarks on th...

Sequentialization for full N-Graphs via sub-N-Graphs

Since proof-nets for MLL- were introduced by Girard (1987), several stud...

An Interactive Proof of Termination for a Concurrent λ-calculus with References and Explicit Substitutions

In this paper we introduce a typed, concurrent λ-calculus with reference...

Exponentially Handsome Proof Nets and Their Normalization

Handsome proof nets were introduced by Retoré as a syntax for multiplica...

Please sign up or login with your details

Forgot password? Click here to reset