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.

翻译：在本文中,我们展示了如何将一种具有通俗、参考和复制等特征的语言解释成验证网,这与不同线性逻辑的片段相对应。我们证明这是一个模拟和充分理论。我们翻译中的一个关键要素是路径区域,一个用来执行我们详细定义和研究的通信原始学的网络大家庭。