4 citations · 12 across the 6 of their papers we have counts for
6 papers
Encapsulation and Dynamic Modularity in the Pi-Calculus
Daniel Hirschkoff, Aurélien Pardon, Tom Hirschowitz +2
We describe a process calculus featuring high level constructs for component-oriented programming in a distributed setting. We propose an extension of the higher-order pi-calculus…
Variable binding, symmetric monoidal closed theories, and bigraphs
Richard Garner, Tom Hirschowitz, Aurélien Pardon
This paper investigates the use of symmetric monoidal closed (SMC) structure for representing syntax with variable binding, in particular for languages with linear aspects. In our…
Contraction-free proofs and finitary games for Linear Logic
André Hirschowitz, Michel Hirschowitz, Tom Hirschowitz
In the standard sequent presentations of Girard's Linear Logic (LL), there are two "non-decreasing" rules, where the premises are not smaller than the conclusion, namely the cut an…
Graphical Presentations of Symmetric Monoidal Closed Theories
Richard Garner, Tom Hirschowitz, Aurélien Pardon
We define a notion of symmetric monoidal closed (SMC) theory, consisting of a SMC signature augmented with equations, and describe the classifying categories of such theories in te…
Binding bigraphs as symmetric monoidal closed theories
Tom Hirschowitz, Aurélien Pardon
Milner's bigraphs are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the pi-calculus and…
Topological Observations on Multiplicative Additive Linear Logic
André Hirschowitz, Michel Hirschowitz, Tom Hirschowitz
As an attempt to uncover the topological nature of composition of strategies in game semantics, we present a ``topological'' game for Multiplicative Additive Linear Logic without p…