# The true concurrency of differential interaction nets

@article{Mazza2016TheTC,
title={The true concurrency of differential interaction nets},
author={Damiano Mazza},
journal={Mathematical Structures in Computer Science},
year={2016},
volume={28},
pages={1097 - 1125}
}
• Damiano Mazza
• Published 21 November 2016
• Computer Science
• Mathematical Structures in Computer Science
We analyse the reduction of differential interaction nets from the point of view of so-called ‘true concurrency,’ that is, employing a non-interleaving model of parallelism. More precisely, we associate with each differential interaction net an event structure describing its reduction. We show how differential interaction nets are only able to generate confusion-free event structures, and we argue that this is a serious limitation in terms of the concurrent behaviours they may express. In fact…
15 Citations
A language featuring concurrency, references and replication into proof nets, which correspond to a fragment of differential linear logic, and a simulation and adequacy theorem are proved.
A language featuring concurrency, references and replication into proof nets, which correspond to a fragment of differential linear logic, and a simulation and adequacy theorem is proved.
• Computer Science
A List of Successes That Can Change the World
• 2016
Two approaches to extend logically-founded process calculi are considered: first, extensions of the process calculus to more closely resemble $$\pi$$-calculus, and second, inspired by denotational models of process calculator, conflating dual types.
This work proposes a new operational semantics for CP based on the idea of observing communication and uses the standard relational denotational semantics of CLL to define an intuitively reasonable notion of observational equivalence.
• Computer Science
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
• 2017
We introduce a geometry of interaction model for Mazza's multiport interaction combinators, a graph-theoretic formalism which is able to faithfully capture concurrent computation as embodied by
• Computer Science
Proc. ACM Program. Lang.
• 2017
This paper introduces sharing into a session-typed language where types are stratified into linear and shared layers with modal operators connecting the layers and retains session fidelity but not the absence of deadlocks.
• Computer Science, Mathematics
• 2019
It is shown by a semantic consideration that the π -calculus is equivalent to a core calculus of Concurrent ML, in the same way that a cartesian closed category is a model of the λ-calculus.
This work introduces coexponentials, a new set of modalities for Classical Linear Logic that codify a distributed form of the structural rules of weakening and contraction that makes them a suitable logical device for encapsulating the pattern of a server receiving requests from an arbitrary number of clients on a single channel.
• Computer Science, Mathematics
ESOP
• 2019
To demonstrate the relevance of the categorical model, it is shown by a semantic consideration that the $$\pi$$-calculus is equivalent to a core calculus of Concurrent ML.
• Computer Science
Proc. ACM Program. Lang.
• 2021
A system of session types based on Classical Linear Logic with coexponentials, which is well-suited for modelling client-server interactions and a type of linear streams, which can be used to interpret generators.

## References

SHOWING 1-10 OF 42 REFERENCES

A universal language for concurrent interaction nets is built, which study enlightens us on the fundamental bricks of concurrency.
• Computer Science
• 1999
This thesis researches in considerable detail the relative expressive power of these systems, both by representing various programming examples in them, and by constructing inter-representations that translate nets from one system to another.
• Computer Science
FoSSaCS
• 2012
It is argued that it is not possible to satisfactorily model parallel extrusion within the framework of stable event structures, so it is proposed to model a process as a pair where E is a prime event structure and X is a set of (bound) names.
This is a draft version of a chapter for the Handbook of Logic and the Foundations of Computer Science, Oxford University Press. The final draft can be found as DAIMI PB 463. It surveys a range of
• Mathematics, Computer Science
Inf. Comput.
• 2004
• Computer Science
TOPL
• 1999
This work shows how a linear type system can be used to recover important static information about a process's behavior, and proves the validity of a tail-call optimization for higher-order functions represented as processes.
This work gives denotational semantics to a wide range of parallel programming languages based on the idea of Milner’s CCS, that processes communicate by events of mutual synchronization, and gets an event structure semantics for CCS.
• Computer Science
Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226)
• 1998
The fusion calculus contains the polyadic /spl pi/-calculus as a proper subcalculus and thus inherits all its expressive power, and is presented as a significant step towards a canonical calculus of concurrency.
• Computer Science
MFCS
• 1989
It is proved that ”linear time” partial order semantics, where causality in runs is explicit, is invariant under refinement, and various bisimulation equivalences based on partial orders are considered.