, Feasible reactivity in a synchronous ??-calculus, Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming, PPDP '07, pp.221-230, 2007.
DOI : 10.1145/1273920.1273951
URL : https://hal.archives-ouvertes.fr/hal-00130322
, Intuitionistic Light Affine Logic, ACM Transactions on Computational Logic, vol.3, issue.1, pp.1-39, 2002.
DOI : 10.1145/504077.504081
, Taming Modal Impredicativity: Superlazy Reduction, LFCS 2009, pp.137-151, 2009.
DOI : 10.2178/bsl/1122038991
, Termination in Higher-Order Concurrent Calculi, FSEN 2009, pp.81-96, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00798788
, Termination in Impure Concurrent Langages, CONCUR 2010, pp.328-342, 2010.
DOI : 10.1007/978-3-642-15375-4_23
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.167.6804
, Acyclic Solos and Differential Interaction Nets, Logical Methods in Computer Science, vol.6, issue.3, 2008.
DOI : 10.2168/LMCS-6(3:11)2010
URL : https://hal.archives-ouvertes.fr/hal-00516609
, Differential interaction nets, Theoretical Computer Science, vol.364, issue.2, pp.166-195, 2006.
DOI : 10.1016/j.tcs.2006.08.003
URL : https://hal.archives-ouvertes.fr/hal-00150274
, Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.1-102, 1987.
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075966
, Light Linear Logic, I&C, vol.143, issue.2, pp.175-204, 1998.
DOI : 10.1007/3-540-60178-3_83
, A Hybrid Type System for Lock-Freedom of Mobile Processes, CAV 2008, pp.80-93, 2008.
, Soft linear logic and polynomial time, Theoretical Computer Science, vol.318, issue.1-2, pp.163-180, 2004.
DOI : 10.1016/j.tcs.2003.10.018
URL : http://doi.org/10.1016/j.tcs.2003.10.018
, The ?-calculus: A Theory of Mobile Processes, 2001.
, A syntax for linear logic, MFPS 1993, pp.513-529, 1994.
DOI : 10.1007/3-540-58027-1_24
, Strong Normalisation in the ?-Calculus, LICS 2001, pp.311-322, 2001.