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

02/10/2021

∙

by   Yann Hamdaoui, et al.

∙

0

∙

share

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.