D. J. Hughes, Proofs Without Syntax, Annals of Mathematics, vol.164, issue.3, pp.1065-1076, 2006.
URL : https://hal.archives-ouvertes.fr/hal-02386878

, Towards Hilbert's 24 th problem: Combinatorial proof invariants: (preliminary version), ENTCS, vol.165, pp.37-63, 2006.

F. Lamarche, Proof Nets for Intuitionistic Linear Logic: Essential Nets, Inria, Research Report, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00347336

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

L. Straßburger, A characterisation of medial as rewriting rule, RTA'07, ser. LNCS, F. Baader, vol.4533, pp.344-358, 2007.

H. Nickau, Hereditarily sequential functionals, International Symposium on Logical Foundations of Computer Science, pp.253-264, 1994.

C. Retoré, Handsome proof-nets: perfect matchings and cographs, Theoretical Computer Science, vol.294, issue.3, pp.473-488, 2003.

G. Mccusker, Games and full abstraction for FPC, Information and Computation, vol.160, issue.1-2, pp.1-61, 2000.

D. G. Corneil, H. Lerchs, and L. K. Stewart-burlingham, Complement reducible graphs, Disc. Appl. Math, 1981.

A. Das and L. Straßburger, On linear rewriting systems for Boolean logic and some applications to proof theory, Logical Methods in Computer Science, vol.12, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01422611

J. Girard, Linear logic, Theor. Comp. Science, vol.50, pp.1-102, 1987.
URL : https://hal.archives-ouvertes.fr/inria-00075966

V. Danos and L. Regnier, The structure of multiplicatives, Arch. Math. Log, vol.28, issue.3, pp.181-203, 1989.

D. J. Hughes, Games and definability for system F, 12th Annual IEEE Symposium on Logic in Computer Science (LICS, pp.76-86, 1997.

A. S. Murawski and C. L. Ong, Evolving games and essential nets for affine polymorphism, International Conference on Typed Lambda Calculi and Applications, pp.360-375, 2001.

D. J. Hughes and W. Heijltjes, Conflict nets: Efficient locally canonical MALL proof nets, LICS'16, pp.437-446, 2016.

J. Herbrand, Investigations in proof theory: The properties of true propositions," in From Frege to Gödel: A source book in mathematical logic, pp.525-581, 1967.

G. Gentzen, Untersuchungenüber das logische Schließen I & II, Mathematische Zeitschrift, vol.39, pp.405-431, 1935.

K. Brünnler, Two restrictions on contraction, Logic Journal of the Interest Group in Pure and Applied Logics, vol.11, issue.5, pp.525-529, 2003.

K. Brünnler and A. Tiu, A local system for classical logic, 8th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR), ser. LNCS, vol.2250, pp.347-361, 2001.

L. Straßburger, MELL in the calculus of structures, Theor. Comput. Sci, vol.309, pp.213-285, 2003.

A. Tubella, A. Guglielmi, and B. Ralph, Removing cycles from proofs, 26th EACSL Annual Conference on Computer Science Logic (CSL), ser. Leibniz International Proceedings in Informatics (LIPIcs), vol.82, pp.1-17, 2017.

L. Straßburger, Combinatorial flows and their normalisation, 2nd Int. Conf. Formal Structures for Computation and Deduction (FSCD), 2017.

P. Boudes, Thick subtrees, games and experiments, Typed Lambda Calculi and Applications (TLCA), 2009.

P. Melliès, Asynchronous games 2: The true concurrency of innocence, Selected Papers of CONCUR, vol.358, pp.200-228, 2004.

S. Castellan, P. Clairambault, and G. Winskel, Symmetry in concurrent games, CSL-LICS'14, p.28, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00990020

D. J. Hughes, First-order proofs without syntax, 2019.