Full Abstraction for PCF, Information and Computation, vol.163, issue.2, pp.409-470, 2000. ,
DOI : 10.1006/inco.2000.2930
URL : http://doi.org/10.1006/inco.2000.2930
Call-by-value games, CSL, pp.1-17, 1997. ,
DOI : 10.1007/BFb0028004
Yet another correctness criterion for Multiplicative Linear Logic with MIX, Logical Foundations of Computer Science, pp.34-46, 1994. ,
DOI : 10.1007/3-540-58140-5_5
The geometry of synchronization, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, pp.1-3510, 2014. ,
DOI : 10.1145/2603088.2603154
URL : https://hal.archives-ouvertes.fr/hal-01091560
Parallelism and synchronization in an infinitary context (long version) Available at http://arxiv, 2015. ,
The structure of multiplicatives, Archive for Mathematical Logic, vol.28, issue.3, pp.181-203, 1989. ,
DOI : 10.1007/BF01622878
Reversible, irreversible and optimal ??-machines, Theoretical Computer Science, vol.227, issue.1-2, pp.79-97, 1999. ,
DOI : 10.1016/S0304-3975(99)00049-3
Geometry of synthesis: a structured approach to VLSI design, POPL, pp.363-375, 2007. ,
Geometry of Synthesis II: From Games to Delay-Insensitive Circuits, Electronic Notes in Theoretical Computer Science, vol.265, pp.301-324, 2010. ,
DOI : 10.1016/j.entcs.2010.08.018
Geometry of synthesis iv: compiling affine recursion into static hardware, pp.221-233, 2011. ,
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
Geometry of interaction I: Interpretation of system F. Logic Colloquium 88, 1989. ,
Memoryful geometry of interaction, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, p.52, 2014. ,
DOI : 10.1145/2603088.2603124
On Full Abstraction for PCF: I, II, and III, Information and Computation, vol.163, issue.2, pp.285-408, 2000. ,
DOI : 10.1006/inco.2000.2917
An introduction to proof nets ,
Applications of the Geometry of Interaction to language implementation, 1994. ,
The geometry of interaction machine, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '95, pp.198-208, 1995. ,
DOI : 10.1145/199448.199483
Call-by-name, Call-by-value, Call-by-need, and the Linear Lambda Calculus, Electronic Notes in Theoretical Computer Science, vol.1, pp.370-392, 1995. ,
DOI : 10.1016/S1571-0661(04)00022-2
Polarized Proof Nets with Cycles and Fixpoints Semantics, TLCA, pp.256-270, 2003. ,
DOI : 10.1007/3-540-44904-3_18
PELCR, ACM Transactions on Computational Logic, vol.8, issue.3, 2007. ,
DOI : 10.1145/1243996.1243997
Parallel implementation models for the lambda-calculus using the geometry of interaction, TLCA, pp.385-399, 2001. ,
LCF considered as a programming language, Theoretical Computer Science, vol.5, issue.3, pp.223-255, 1977. ,
DOI : 10.1016/0304-3975(77)90044-5
Call-by-Value in a Basic Logic for Interaction, ESOP, pp.428-448, 2014. ,
DOI : 10.1007/978-3-319-12736-1_23
A lambda calculus for quantum computation with classical control, TLCA, pp.354-368, 2005. ,
DOI : 10.1017/S0960129506005238
URL : https://hal.archives-ouvertes.fr/hal-00483924
Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics, RTA 2005, pp.219-234, 2005. ,
DOI : 10.1007/978-3-540-32033-3_17
Measurements in Proof Nets as Higher-Order Quantum Circuits, ESOP, pp.371-391, 2014. ,
DOI : 10.1007/978-3-642-54833-8_20
URL : https://hal.archives-ouvertes.fr/hal-01091582