A Bigraph Relational Model, LFMTP, pp.14-28, 2011. ,
DOI : 10.4204/EPTCS.71.2
Brane Calculi, CMSB, pp.257-278, 2004. ,
DOI : 10.1016/S0020-0190(01)00214-9
Mobile ambients, FOSSACS'98, 1998. ,
DOI : 10.1016/s0304-3975(99)00231-5
URL : http://doi.org/10.1016/s0304-3975(99)00231-5
Classical and Intuitionistic Subexponential Logics Are Equally Expressive, CSL, pp.185-199, 2010. ,
DOI : 10.1007/978-3-642-15205-4_17
URL : https://hal.archives-ouvertes.fr/inria-00534865
Undecidability of Multiplicative Subexponential Logic, 3rd LINEARITY, pp.1-8, 2014. ,
DOI : 10.4204/EPTCS.176.1
URL : https://hal.archives-ouvertes.fr/hal-00998753
The structure of exponentials: Uncovering the dynamics of linear logic proofs, LNCS, vol.713, pp.159-171, 1993. ,
DOI : 10.1007/BFb0022564
Bigraphs and mobile processes (revised), 2004. ,
Pure bigraphs: Structure and dynamics. Information and Computation, pp.60-122, 2006. ,
DOI : 10.1016/j.ic.2005.07.003
URL : http://doi.org/10.1016/j.ic.2005.07.003
The Space and Motion of Communicating Agents, 2009. ,
DOI : 10.1017/CBO9780511626661
Exploiting non-canonicity in the sequent calculus, 2009. ,
URL : https://hal.archives-ouvertes.fr/pastel-00005487
Algorithmic specifications in linear logic with subexponentials, Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming, PPDP '09, pp.129-140, 2009. ,
DOI : 10.1145/1599410.1599427
On subexponentials, focusing and modalities in concurrent systems. Draft Manuscript submitted for publication, 2015. ,
An extended framework for specifying and reasoning about proof systems, Journal of Logic and Computation, vol.26, issue.2, 2014. ,
DOI : 10.1093/logcom/exu029
Bigraphs with sharing, Theoretical Computer Science, vol.577, pp.43-73, 2015. ,
DOI : 10.1016/j.tcs.2015.02.011
URL : http://doi.org/10.1016/j.tcs.2015.02.011