A. Alcolei, P. Clairambault, M. Hyland, and G. Winskel, 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

A. Alcolei, P. Clairambault, and O. Laurent, Resource-tracking concurrent games, Foundations of Software Science and Computation Structures, pp.27-44, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02096306

S. Abramsky, K. Honda, and G. Mccusker, A fully abstract game semantics for general references, 13th annual IEEE Symposium on Logic in Computer Science, pp.334-344, 1998.

S. Abramsky and R. Jagadeesan, Games and full completeness for multiplicative linear logic, The Journal of Symbolic Logic, vol.59, issue.2, pp.543-574, 1994.

S. Abramsky, R. Jagadeesan, and P. Malacaria, Full abstraction for PCF, Inf. Comput, vol.163, issue.2, pp.409-470, 2000.

S. Abramsky and G. Mccusker, 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.

S. Abramsky and P. Melliès, Concurrent games and full completeness, 14th Annual IEEE Symposium on Logic in Computer Science, pp.431-442, 1999.

F. Barbanera and S. Berardi, A symmetric lambda calculus for "classical" program extraction, Theoretical Aspects of Computer Software, International Conference, pp.495-515, 1994.

P. Baillot, V. Danos, T. Ehrhard, and L. Regnier, 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. Brunel, M. Gaboardi, D. Mazza, and S. Zdancewic, A core quantitative coeffect calculus, Programming Languages and Systems -23rd European Symposium on Programming, pp.351-370, 2014.

A. Blass, A game semantics for linear logic, Annals of Pure and Applied logic, vol.56, issue.1-3, pp.183-220, 1992.

F. Baader and T. Nipkow, Term Rewriting and All That, 1998.

R. Samuel and . Buss, On herbrand's theorem, International Workshop on Logic and Computational Complexity, pp.195-209, 1994.

S. Castellan, Structures concurrentes en sémantique des jeux, 2017.

S. Castellan and P. Clairambault, 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

S. Castellan, P. Clairambault, J. Hayman, and G. Winskel, 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

S. Castellan, P. Clairambault, H. Paquet, and G. Winskel, 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

S. Castellan, P. Clairambault, S. Rideau, and G. Winskel, Games and strategies as event structures, Logical Methods in Computer Science, vol.13, issue.3, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01302713

S. Castellan, P. Clairambault, and G. Winskel, 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

S. Castellan, P. Clairambault, and G. Winskel, Thin games with symmetry and concurrent hyland-ong games, Logical Methods in Computer Science, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01068769

P. Clairambault, G. Marc-de-visme, and . Winskel, Game semantics for quantum programming, PACMPL, vol.3, issue.POPL, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02112184

T. Coquand, A semantics of evidence for classical arithmetic, Journal of Symbolic Logic, vol.60, issue.1, pp.325-337, 1995.

S. Castellan and H. Paquet, Probabilistic programming inference via intensional semantics, Programming Languages and Systems, pp.322-349, 2019.

J. , R. B. Cockett, and R. A. Seely, Weakly distributive categories, Journal of Pure and Applied Algebra, vol.114, issue.2, pp.133-173, 1997.

V. Danos, S. Russell, and . Harmer, Probabilistic game semantics, ACM Transactions on Computational Logic, vol.3, issue.3, pp.359-382, 2002.

V. Danos, J. Joinet, and H. Schellinx, A new deconstructive logic: Linear logic, Journal of Symbolic Logic, vol.62, issue.3, pp.755-807, 1997.

T. Ehrhard, 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

M. P. Fiore and C. Hur, Equational systems and free constructions (extended abstract), Automata, Languages and Programming, 34th International Colloquium, pp.607-618, 2007.

C. Führmann and D. J. Pym, On categorical models of classical logic and the geometry of interaction, Mathematical Structures in Computer Science, vol.17, issue.5, pp.957-1027, 2007.

C. Faggian and M. Piccolo, 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

G. Gentzen, Untersuchungen über das logische schließen. i. Mathematische zeitschrift, vol.39, pp.176-210, 1935.

D. R. Ghica, Slot games: a quantitative model of computation, Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principle of Programming Languages, pp.85-97, 2005.

J. Girard, Linear logic. Theoretical Computer Science, vol.50, pp.1-102, 1987.

J. Girard, 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

P. Gerhardy and U. Kohlenbach, Extracting herbrand disjunctions by functional interpretation, Arch. Math. Log, vol.44, issue.5, pp.633-644, 2005.

D. R. Ghica and A. S. Murawski, Angelic semantics of fine-grained concurrency, Ann. Pure Appl. Logic, vol.151, issue.2-3, pp.89-114, 2008.

J. A. Goguen, What is unification? a categorical view of substitution, equation and solution, 1989.

D. R. Ghica and A. I. Smith, Bounded linear types in a resource semiring, Programming Languages and Systems -23rd European Symposium on Programming, pp.331-350, 2014.

M. Hyland and V. D. Paiva, Full intuitionistic linear logic, Annals of Pure and Applied Logic, vol.64, issue.3, pp.273-291, 1993.

W. Heijltjes, Classical proof forestry, Ann. Pure Appl. Logic, vol.161, issue.11, pp.1346-1366, 2010.

J. Herbrand, Recherches sur la théorie de la démonstration, 1930.

R. Harmer and G. Mccusker, A fully abstract game semantics for finite nondeterminism, 14th Symposium on Logic in Computer Science, pp.422-430, 1999.

T. Hoare, B. Möller, G. Struth, and I. Wehrman, Concurrent Kleene algebra and its foundations, Journal of Logic and Algebraic method in Programming, vol.80, issue.6, pp.266-296, 2011.

J. , M. E. Hyland, and C. Ong, On full abstraction for PCF: I, II, and III, Inf. Comput, vol.163, issue.2, pp.285-408, 2000.

S. Hetzl and D. Weller, Expansion trees with cut, 2013.

K. Honda and N. Yoshida, Game theoretic analysis of call-by-value computation, International Colloquium on Automata, Languages, and Programming, pp.225-236, 1997.

U. Kohlenbach, On the no-counterexample interpretation, Journal of Symbolic Logic, vol.64, issue.4, pp.1491-1511, 1999.

J. Krivine, Realizability in classical logic. Panoramas et synthèses, vol.27, pp.197-229, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00154500

J. Laird, Full abstraction for functional languages with control, 12th Annual IEEE Symposium on Logic in Computer Science, pp.58-67, 1997.

J. Laird, A fully abstract game semantics of local exceptions, 16th Annual IEEE Symposium on Logic in Computer Science, pp.105-114, 2001.

J. Laird, Game semantics for higher-order concurrency, International Conference on Foundations of Software Technology and Theoretical Computer Science, pp.417-428, 2006.

O. Laurent, Game semantics for first-order logic, Logical Methods in Computer Science, vol.6, issue.4, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00528528

F. and W. Lawvere, Adjointness in foundations. Dialectica, vol.23, issue.3-4, pp.281-296, 1969.

J. Laird, G. Manzonetto, G. Mccusker, and M. Pagani, 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

P. Lorenzen, Atti del Congresso Internazionale di Filosofia, pp.187-194

R. Mittermayr and J. Blieberger, Timing analysis of concurrent programs, 12th International Workshop on Worst-Case Execution Time Analysis, vol.23, pp.59-68, 2012.

R. Mckinley, Proof nets for Herbrand's theorem, ACM Trans. Comput. Log, vol.14, issue.1, p.5, 2013.

P. Melliès, Asynchronous games 4: A fully complete model of propositional linear logic, 20th IEEE Symposium on Logic in Computer Science, pp.386-395, 2005.

P. Melliès, Game semantics in string diagrams, 27th Annual IEEE Symposium on Logic in Computer Science, pp.481-490, 2012.

A. Dale and . Miller, A compact representation of proofs, Studia Logica, vol.46, issue.4, pp.347-370, 1987.

S. Mimram, 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

P. Melliès and S. Mimram, Asynchronous games: Innocence without alternation, Concurrency Theory, 18th International Conference, pp.395-411, 2007.

. Prakash-panangaden, The 2017 alonzo church award, ACM SIGLOG News, vol.4, issue.3, pp.3-9, 2017.

M. Parigot, Lambda-my-calculus: An algorithmic interpretation of classical natural deduction, Logic Programming and Automated Reasoning,International Conference, pp.190-201, 1992.

S. Rideau and G. Winskel, Concurrent strategies, 26th Annual IEEE Symposium on Logic in Computer Science, pp.409-418, 2011.

D. Sands, Operational theories of improvement in functional languages (extended abstract), Workshop on Functional Programming, pp.298-311, 1991.

S. Dana and . Scott, Domains for denotational semantics, International Colloquium on Automata, Languages, and Programming, pp.577-610, 1982.

A. G. Robert and . Seely, Hyperdoctrines, natural deduction and the Beck condition, Math. Log. Q, vol.29, issue.10, pp.505-542, 1983.

A. G. Robert and . Seely, Linear logic,*-autonomous categories and cofree coalgebras, 1987.

G. Winskel, Advances in Petri Nets, Petri Nets: Central Models and Their Properties, pp.325-392, 1986.