S. Abramsky, Computational interpretations of linear logic, Theoretical Computer Science, vol.111, issue.1-2, pp.3-57, 1993.
DOI : 10.1016/0304-3975(93)90181-R

B. Accattoli, E. Bonelli, D. Kesner, and C. Lombardi, A nonstandard standardization theorem, Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, pp.659-670, 2014.
DOI : 10.1145/2535838.2535886

B. Accattoli and U. D. Lago, Beta reduction is invariant, indeed, 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, 2014.
DOI : 10.1145/2603088.2603105
URL : https://hal.archives-ouvertes.fr/hal-01091551

J. Andreoli, Logic Programming with Focusing Proofs in Linear Logic, Journal of Logic and Computation, vol.2, issue.3, pp.297-347, 1992.
DOI : 10.1093/logcom/2.3.297

D. Baelde and D. Miller, Least and greatest fixed points in linear logic, LPAR'07, pp.92-106, 2007.

G. Bellin and P. Scott, On the ??-calculus and linear logic, Theoretical Computer Science, vol.135, issue.1, pp.11-65, 1994.
DOI : 10.1016/0304-3975(94)00104-9

G. Bierman, On Intuitionistic Linear Logic, 1993.

K. Chaudhuri, N. Guenot, and L. Straßburger, The focused calculus of structures, LIPIcs, vol.12, issue.11, pp.159-173, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00772420

P. Curien and H. Herbelin, The duality of computation, ICFP'00: Proceedings of the fifth ACM SIGPLAN international conference on Functional programming, pp.233-243, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00156377

R. Dyckhoff and S. Lengrand, LJQ: A Strongly Focused Calculus for Intuitionistic Logic, LNCS, vol.94, issue.06, pp.173-185, 2006.
DOI : 10.1090/trans2/094/02
URL : https://hal.archives-ouvertes.fr/hal-00150287

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

H. Herbelin, A ??-calculus structure isomorphic to Gentzen-style sequent calculus structure, CSL'94, pp.61-75, 1994.
DOI : 10.1007/BFb0022247
URL : https://hal.archives-ouvertes.fr/inria-00381525

H. Herbelin, Séquents qu'on calcule: de l'interprétation du calcul des séquents comme calcul de lambda-termes et comme calcul de stratégies gagnantes, 1995.

D. Kesner and S. Lengrand, Resource operators for the ?-calculus. Information and Computation, pp.419-473, 2007.

O. Laurent, Etude de la polarisation en logique, Thèse de doctorat, 2002.
URL : https://hal.archives-ouvertes.fr/tel-00007884

O. Laurent, Polarized proof-nets and ????-calculus, Theoretical Computer Science, vol.290, issue.1, pp.161-188, 2003.
DOI : 10.1016/S0304-3975(01)00297-3
URL : https://hal.archives-ouvertes.fr/hal-00009114

L. Paul-blain, Call-by-push-value: Decomposing call-by-value and call-by-name. Higher-Order and Symbolic Computation, pp.377-414, 2006.

C. Liang and D. Miller, Focusing and Polarization in Intuitionistic Logic, LNCS, vol.4646, issue.07, pp.451-465, 2007.
DOI : 10.1007/978-3-540-74915-8_34
URL : https://hal.archives-ouvertes.fr/inria-00167231

G. Munch-maccagnoni, Focalisation and Classical Realisability, LNCS, vol.50, issue.1-3, pp.409-423, 2009.
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00409793

M. Parigot, ?µ-calculus: An algorithmic interpretation of classical natural deduction, LPAR'92, pp.190-201, 1992.

R. J. Simmons, Structural Focalization, ACM Transactions on Computational Logic, vol.15, issue.3, pp.1-2133, 2014.
DOI : 10.1145/2629678

P. Wadler, A syntax for linear logic, MFPS'93, pp.513-529, 1993.
DOI : 10.1007/3-540-58027-1_24

P. Wadler, Propositions as sessions, Journal of Functional Programming, vol.16, issue.2-3, pp.384-418, 2014.
DOI : 10.1016/0304-3975(87)90045-4

S. Zimmermann, Vers une Ludique Différentielle, Thèse de doctorat, 2013.