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

02/10/2021
by   Yann Hamdaoui, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

12/15/2017

Taylor expansion in linear logic is invertible

Each Multiplicative Exponential Linear Logic (MELL) proof-net can be exp...
04/30/2021

Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets

We prove that (strong) fully-concurrent bisimilarity and causal-net bisi...
09/26/2020

Neural Proof Nets

Linear logic and the linear λ-calculus have a long standing tradition in...
12/23/2019

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...
02/13/2020

The Abstract Machinery of Interaction (Long Version)

This paper revisits the Interaction Abstract Machine (IAM), a machine ba...
02/09/2021

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...
11/16/2021

A Maude Implementation of Rewritable Petri Nets: a Feasible Model for Dynamically Reconfigurable Systems

Petri Nets (PN) are a central, theoretically sound model for concurrent ...