The True Concurrency of Herbrand's Theorem, 27th EACSL Annual Conference on Computer Science Logic, vol.119, pp.1-5, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01886968
Resource-tracking concurrent games, Foundations of Software Science and Computation Structures, pp.27-44, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02096306
A fully abstract game semantics for general references, 13th annual IEEE Symposium on Logic in Computer Science, pp.334-344, 1998. ,
Games and full completeness for multiplicative linear logic, The Journal of Symbolic Logic, vol.59, issue.2, pp.543-574, 1994. ,
Full abstraction for PCF, Inf. Comput, vol.163, issue.2, pp.409-470, 2000. ,
Linearity, sharing and state: a fully abstract game semantics for idealized algol with active expressions, Electr. Notes Theor. Comput. Sci, vol.3, pp.2-14, 1996. ,
Concurrent games and full completeness, 14th Annual IEEE Symposium on Logic in Computer Science, pp.431-442, 1999. ,
A symmetric lambda calculus for "classical" program extraction, Theoretical Aspects of Computer Software, International Conference, pp.495-515, 1994. ,
Believe it or not, ajm's games model is a model of classical linear logic, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, pp.68-75, 1997. ,
A core quantitative coeffect calculus, Programming Languages and Systems -23rd European Symposium on Programming, pp.351-370, 2014. ,
A game semantics for linear logic, Annals of Pure and Applied logic, vol.56, issue.1-3, pp.183-220, 1992. ,
Term Rewriting and All That, 1998. ,
On herbrand's theorem, International Workshop on Logic and Computational Complexity, pp.195-209, 1994. ,
Structures concurrentes en sémantique des jeux, 2017. ,
Causality vs. interleavings in concurrent game semantics, 27th International Conference on Concurrency Theory, vol.59, pp.1-32, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01474550
Non-angelic concurrent game semantics, ternational Conference on Foundations of Software Science and Computation Structures, pp.3-19, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01886951
The concurrent game semantics of probabilistic PCF, 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, pp.215-224, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01886965
Games and strategies as event structures, Logical Methods in Computer Science, vol.13, issue.3, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01302713
The parallel intensionally fully abstract games model of PCF, 30th Annual ACM/IEEE Symposium on Logic in Computer Science, pp.232-243, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01286477
Thin games with symmetry and concurrent hyland-ong games, Logical Methods in Computer Science, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-01068769
Game semantics for quantum programming, PACMPL, vol.3, issue.POPL, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02112184
A semantics of evidence for classical arithmetic, Journal of Symbolic Logic, vol.60, issue.1, pp.325-337, 1995. ,
Probabilistic programming inference via intensional semantics, Programming Languages and Systems, pp.322-349, 2019. ,
Weakly distributive categories, Journal of Pure and Applied Algebra, vol.114, issue.2, pp.133-173, 1997. ,
Probabilistic game semantics, ACM Transactions on Computational Logic, vol.3, issue.3, pp.359-382, 2002. ,
A new deconstructive logic: Linear logic, Journal of Symbolic Logic, vol.62, issue.3, pp.755-807, 1997. ,
The Scott model of linear logic is the extensional collapse of its relational model, Theor. Comput. Sci, vol.424, pp.20-45, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00369831
Equational systems and free constructions (extended abstract), Automata, Languages and Programming, 34th International Colloquium, pp.607-618, 2007. ,
On categorical models of classical logic and the geometry of interaction, Mathematical Structures in Computer Science, vol.17, issue.5, pp.957-1027, 2007. ,
Partial orders, event structures and linear strategies, Typed Lambda Calculi and Applications, 9th International Conference, pp.95-111, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-00629450
Untersuchungen über das logische schließen. i. Mathematische zeitschrift, vol.39, pp.176-210, 1935. ,
Slot games: a quantitative model of computation, Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principle of Programming Languages, pp.85-97, 2005. ,
, Linear logic. Theoretical Computer Science, vol.50, pp.1-102, 1987.
A new constructive logic: Classical logic, Mathematical Structures in Computer Science, vol.1, issue.3, pp.255-296, 1991. ,
URL : https://hal.archives-ouvertes.fr/inria-00075117
Extracting herbrand disjunctions by functional interpretation, Arch. Math. Log, vol.44, issue.5, pp.633-644, 2005. ,
Angelic semantics of fine-grained concurrency, Ann. Pure Appl. Logic, vol.151, issue.2-3, pp.89-114, 2008. ,
What is unification? a categorical view of substitution, equation and solution, 1989. ,
Bounded linear types in a resource semiring, Programming Languages and Systems -23rd European Symposium on Programming, pp.331-350, 2014. ,
Full intuitionistic linear logic, Annals of Pure and Applied Logic, vol.64, issue.3, pp.273-291, 1993. ,
Classical proof forestry, Ann. Pure Appl. Logic, vol.161, issue.11, pp.1346-1366, 2010. ,
Recherches sur la théorie de la démonstration, 1930. ,
A fully abstract game semantics for finite nondeterminism, 14th Symposium on Logic in Computer Science, pp.422-430, 1999. ,
Concurrent Kleene algebra and its foundations, Journal of Logic and Algebraic method in Programming, vol.80, issue.6, pp.266-296, 2011. ,
On full abstraction for PCF: I, II, and III, Inf. Comput, vol.163, issue.2, pp.285-408, 2000. ,
Expansion trees with cut, 2013. ,
Game theoretic analysis of call-by-value computation, International Colloquium on Automata, Languages, and Programming, pp.225-236, 1997. ,
On the no-counterexample interpretation, Journal of Symbolic Logic, vol.64, issue.4, pp.1491-1511, 1999. ,
, Realizability in classical logic. Panoramas et synthèses, vol.27, pp.197-229, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00154500
Full abstraction for functional languages with control, 12th Annual IEEE Symposium on Logic in Computer Science, pp.58-67, 1997. ,
A fully abstract game semantics of local exceptions, 16th Annual IEEE Symposium on Logic in Computer Science, pp.105-114, 2001. ,
Game semantics for higher-order concurrency, International Conference on Foundations of Software Technology and Theoretical Computer Science, pp.417-428, 2006. ,
Game semantics for first-order logic, Logical Methods in Computer Science, vol.6, issue.4, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-00528528
, Adjointness in foundations. Dialectica, vol.23, issue.3-4, pp.281-296, 1969.
Weighted relational models of typed lambda-calculi, 28th Annual ACM/IEEE Symposium on Logic in Computer Science, pp.301-310, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-01144064
Atti del Congresso Internazionale di Filosofia, pp.187-194 ,
Timing analysis of concurrent programs, 12th International Workshop on Worst-Case Execution Time Analysis, vol.23, pp.59-68, 2012. ,
Proof nets for Herbrand's theorem, ACM Trans. Comput. Log, vol.14, issue.1, p.5, 2013. ,
Asynchronous games 4: A fully complete model of propositional linear logic, 20th IEEE Symposium on Logic in Computer Science, pp.386-395, 2005. ,
Game semantics in string diagrams, 27th Annual IEEE Symposium on Logic in Computer Science, pp.481-490, 2012. ,
A compact representation of proofs, Studia Logica, vol.46, issue.4, pp.347-370, 1987. ,
The structure of first-order causality, Mathematical Structures in Computer Science, vol.21, issue.1, pp.65-110, 2011. ,
URL : https://hal.archives-ouvertes.fr/inria-00411399
Asynchronous games: Innocence without alternation, Concurrency Theory, 18th International Conference, pp.395-411, 2007. ,
The 2017 alonzo church award, ACM SIGLOG News, vol.4, issue.3, pp.3-9, 2017. ,
Lambda-my-calculus: An algorithmic interpretation of classical natural deduction, Logic Programming and Automated Reasoning,International Conference, pp.190-201, 1992. ,
Concurrent strategies, 26th Annual IEEE Symposium on Logic in Computer Science, pp.409-418, 2011. ,
Operational theories of improvement in functional languages (extended abstract), Workshop on Functional Programming, pp.298-311, 1991. ,
Domains for denotational semantics, International Colloquium on Automata, Languages, and Programming, pp.577-610, 1982. ,
Hyperdoctrines, natural deduction and the Beck condition, Math. Log. Q, vol.29, issue.10, pp.505-542, 1983. ,
Linear logic,*-autonomous categories and cofree coalgebras, 1987. ,
Advances in Petri Nets, Petri Nets: Central Models and Their Properties, pp.325-392, 1986. ,