S. Abramsky, R. Jagadeesan, and P. Malacaria, Full abstraction for PCF, Inf. Comput, vol.163, issue.2, pp.409-470, 2000.
DOI : 10.1006/inco.2000.2930
URL : https://doi.org/10.1006/inco.2000.2930

F. Barbanera and S. Berardi, A symmetric lambda calculus for "classical" program extraction, Theoretical Aspects of Computer Software, International Conference TACS '94, vol.789, pp.495-515, 1994.
DOI : 10.1006/inco.1996.0025
URL : https://doi.org/10.1006/inco.1996.0025

M. Barr, *-autonomous categories and linear logic, Mathematical Structures in Computer Science, vol.1, issue.2, pp.159-178, 1991.
DOI : 10.1017/s0960129500001274

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

P. Clairambault, J. Gutierrez, and G. Winskel, The winning ways of concurrent games, Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, LICS 2012, pp.235-244, 2012.
DOI : 10.1109/lics.2012.34
URL : http://www.cl.cam.ac.uk/%7Egw104/lics2012_submission_14.pdf

J. R. Cockett and R. A. Seely, Weakly distributive categories, Journal of Pure and Applied Algebra, vol.114, issue.2, pp.133-173, 1997.
DOI : 10.1016/0022-4049(95)00160-3
URL : https://doi.org/10.1016/0022-4049(95)00160-3

T. Coquand, A semantics of evidence for classical arithmetic, J. Symb. Log, vol.60, issue.1, pp.325-337, 1995.
DOI : 10.2307/2275524

V. Danos, J. Joinet, and H. Schellinx, A new deconstructive logic: Linear logic, J. Symb. Log, vol.62, issue.3, pp.755-807, 1997.
DOI : 10.2307/2275572
URL : http://www.logique.jussieu.fr/www.hars/Papers/DJS/newdecons.ps.Z

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.

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

P. Gerhardy and U. Kohlenbach, Extracting herbrand disjunctions by functional interpretation, Arch. Math. Log, vol.44, issue.5, pp.633-644, 2005.
DOI : 10.7146/brics.v10i32.21800
URL : https://tidsskrift.dk/brics/article/download/21800/19231

J. Girard, Linear logic. Theor. Comput. Sci, 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

K. Gödel, Über eine bisher noch nicht benützte erweiterung des finiten standpunktes. dialectica, vol.12, pp.280-287, 1958.

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

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

U. Kohlenbach, On the no-counterexample interpretation, J. Symb. Log, 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

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

. William-lawvere, 5:22 The True Concurrency of Herbrand's Theorem Lemma 48. Let X be a directed set of ?-maximal configurations. Then, Adjointness in foundations. Dialectica, vol.23, issue.3-4, pp.281-296, 1969.