S. Abramsky and R. Jagadeesan, Abstract, The Journal of Symbolic Logic, vol.417, issue.02, pp.543-574, 1994.
DOI : 10.1007/BF01622878

S. Abramsky, R. Jagadeesan, and P. Malacaria, Full Abstraction for PCF, Information and Computation, vol.163, issue.2, pp.409-470, 2000.
DOI : 10.1006/inco.2000.2930

S. Abramsky and G. Mccusker, Game Semantics, 1999.
DOI : 10.1007/978-3-642-58622-4_1

F. Alberti, Analyse statique typée des propriétés structurelles des programmes, Thèse de doctorat, 2005.

R. Amadio and P. Curien, Domains and Lambda-calculi, 1998.
DOI : 10.1017/CBO9780511983504
URL : https://hal.archives-ouvertes.fr/inria-00070008

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

A. Asperti and S. Guerrini, The optimal implementation of functional programming languages, 1998.

H. Barendregt, M. Coppo, and M. Dezani, A filter lambda model and the completeness of type assignment, The Journal of Symbolic Logic, vol.37, issue.04, pp.931-940, 1983.
DOI : 10.1002/malq.19800261902

M. Berger, N. Honda, and . Yoshida, Sequentiality and the ??-Calculus, Proc.of the 5th International Conference on Typed Lambda Calculi and Applications (TLCA'01), pp.29-45, 2001.
DOI : 10.1007/3-540-45413-6_7

G. Berry, Stable models of typed ??-calculi, Proc. International Colloquium on Algebra, Logic and Programming (ICALP' 78), pp.72-89, 1978.
DOI : 10.1007/3-540-08860-1_7

G. Berry, Modèlescompì etement adéquats et stables des lambda-calculs typés, Thèse de Doctorat d'Etat, 1979.

G. Berry and P. Curien, Sequential algorithms on concrete data structures, Theoretical Computer Science, vol.20, issue.3, pp.265-321, 1982.
DOI : 10.1016/S0304-3975(82)80002-9
URL : http://doi.org/10.1016/s0304-3975(82)80002-9

C. Böhm and A. Berarducci, Automatic synthesis of typed ??-programs on term algebras, Theoretical Computer Science, vol.39, pp.135-154, 1985.
DOI : 10.1016/0304-3975(85)90135-5

T. Coquand and G. Huet, The calculus of constructions, Information and Computation, vol.76, issue.2-3, pp.95-120, 1988.
DOI : 10.1016/0890-5401(88)90005-3
URL : https://hal.archives-ouvertes.fr/inria-00076024

P. Curien, On the symmetry of sequentiality, Proc. Mathematical Foundations of Programming Semantics, pp.29-71, 1993.
DOI : 10.1007/3-540-58027-1_2

P. Curien, Abstract B??hm trees, Mathematical Structures in Computer Science, vol.8, issue.6, pp.559-591, 1998.
DOI : 10.1017/S0960129598002631

P. Curien and H. Herbelin, The duality of computation, Proc. Int. Conf. on Functional Programming, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00156377

P. Curien, Notes on game semantics, 2006.

V. Danos, La logique linéaire appliquéè a l'´ etude de divers processus de normalisation, Thèse de Doctorat, 1990.

V. Danos, J. Joinet, and H. Schellinx, Abstract, The Journal of Symbolic Logic, vol.II, issue.03, pp.755-807, 1997.
DOI : 10.1007/BF00885763
URL : https://hal.archives-ouvertes.fr/inria-00528352

N. De-bruijn, The mathematical language AUTOMATH, its usage, and some of its extensions, Symposium on Automatic Demonstration, pp.29-61, 1968.
DOI : 10.1007/BFb0060623

N. De-bruijn, A survey of the project Automath, in To H.B. Curry: essays on combinatory logic, lambda-calculus, and formalism, pp.479-490, 1980.

T. Ehrhard, Hypercoherences: a strongly stable model of linear logic, Mathematical Structures in Computer Science, vol.1, issue.04, pp.365-385, 1993.
DOI : 10.1016/0304-3975(77)90044-5
URL : https://hal.archives-ouvertes.fr/hal-00527026

T. Ehrhard and O. Laurent, Interpreting a finitary pi-calculus in differential interaction nets, Information and Computation, vol.208, issue.6, pp.606-633, 2010.
DOI : 10.1016/j.ic.2009.06.005
URL : https://hal.archives-ouvertes.fr/hal-00483780

U. Engberg and G. Winskel, Petri nets as models of linear logic, Proc. 15th Coll. Trees in Algebra and Programming (CAAP), pp.147-161, 1990.
DOI : 10.1007/3-540-52590-4_46

A. Filinski, Linear continuations, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '92, pp.27-38, 1992.
DOI : 10.1145/143165.143174

S. Fortune, D. Leivant, and M. O. Donnell, The Expressiveness of Simple and Second-Order Type Structures, Journal of the ACM, vol.30, issue.1, pp.151-185, 1983.
DOI : 10.1145/322358.322370

S. Fortune, D. Leivant, and M. O. Donnell, Typing and computational properties of lambda expressions, Theoretical Computer Science, vol.44, pp.51-68, 1986.

J. Girard, Interprétation fonctionnelle etéliminationetélimination des coupures dans l'arithmétique d'ordre supérieur, Thèse d'Etat, 1972.

J. Girard, The system F of variable types, fifteen years later, Theoretical Computer Science, vol.45, pp.159-192, 1986.
DOI : 10.1016/0304-3975(86)90044-7

J. Girard and L. Logic, Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.1-101, 1987.
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075966

J. Girard, Proof-theory and logical complexity I, 1987.

J. Girard, Geometry of Interaction 1: Interpretation of System F, Proc. Logic Colloquium '88, pp.221-260, 1989.
DOI : 10.1016/S0049-237X(08)70271-4

J. Girard, A new constructive logic: classic logic, Mathematical Structures in Computer Science, vol.7, issue.2, pp.255-296, 1991.
DOI : 10.1016/0304-3975(87)90045-4

J. Girard, Light Linear Logic, Information and Computation, vol.143, issue.2, pp.175-204, 1998.
DOI : 10.1006/inco.1998.2700

J. Girard, Locus solum: from the rules of logic to the logic of rules, Mathematical Structures in Computer Science, vol.11, issue.3, pp.301-506, 2001.

J. Girard, Geometry of Interaction V: Logic in the hyperfinite factor, Theoretical Computer Science, vol.412, issue.20
DOI : 10.1016/j.tcs.2010.12.016
URL : https://hal.archives-ouvertes.fr/hal-01322171

G. Gonthier, M. Abadi, and J. Lévy, The geometry of optimal lambda reduction, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '92, 1992.
DOI : 10.1145/143165.143172

T. Griffin, A formulae-as-type notion of control, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '90, 1990.
DOI : 10.1145/96709.96714

J. Guzman and P. Hudak, Single-threaded polymorphic lambda calculus, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science, 1990.
DOI : 10.1109/LICS.1990.113759

M. Hasegawa, Linearly Used Effects: Monadic and CPS Transformations into the Linear Lambda Calculus, Proc. 6th International Symposium on Functional and Logic Programming Aizu, Springer Lecture Notes in Computer Science 2441, pp.167-182, 2002.
DOI : 10.1007/3-540-45788-7_10

R. Hindley and G. Longo, Lambda-Calculus Models and Extensionality, Zeitschrift f??r Mathematische Logik und Grundlagen der Mathematik, vol.5, issue.19-21, pp.289-310, 1980.
DOI : 10.1002/malq.19800261902

W. Howard, The formulas-as-types notion of construction, in To H.B. Curry: essays on combinatory logic, lambda-calculus, and formalism, pp.479-490, 1980.

M. Hyland and L. Ong, On full abstraction for PCF, pp.285-408, 2000.

J. Krivine, Réalisabilité classique, in Interactive models of computation and program behaviour, Panoramas et Synthèses, 2010.

Y. Lafont, The linear abstract machine, Theoretical Computer Science, vol.59, issue.1-2, pp.157-180, 1988.
DOI : 10.1016/0304-3975(88)90100-4

J. Lamping, An algorithm for optimal lambda calculus reduction, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '90, pp.16-30, 1990.
DOI : 10.1145/96709.96711

O. Laurent, Syntax vs. semantics: A polarized approach, Theoretical Computer Science, vol.343, issue.1-2, pp.177-206, 2005.
DOI : 10.1016/j.tcs.2005.05.012
URL : https://hal.archives-ouvertes.fr/hal-00003759

O. Laurent and L. Regnier, About translations of classical logic into polarised linear logic, Proc. LICS 2003

J. Lévy, Réductions correctes et optimales dans le lambda-calcul, Thèse d'Etat, 1978.

J. Lévy, Optimal reductions in the lambda-calculus, in To H.B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formalism, pp.159-191, 1980.

P. Lincoln, J. Mitchell, and A. Scedrov, Decision problems for propositional linear logic, Annals of Pure and Applied Logic, vol.56, issue.1-3, pp.239-311, 1992.
DOI : 10.1016/0168-0072(92)90075-B

I. Mackie, Abstract, Journal of Functional Programming, vol.7, issue.04, pp.395-433, 1993.
DOI : 10.1145/321992.321996
URL : https://hal.archives-ouvertes.fr/hal-00984284

P. Martin-löf, Lecture notes on the domain interpretation of type theory, Proc. Workshop on Semantics of Programming Languages, 1983.

N. Marti-oliet and J. Meseguer, From petri nets to linear logic, Proc. Category Theory and Computer Science, pp.313-340, 1989.
DOI : 10.1007/BFb0018359

D. Miller, An Overview of Linear Logic Programming, Linear Logic in Computer Science, pp.119-150, 2004.
DOI : 10.1017/CBO9780511550850.004

R. Milner, J. Parrow, and D. Walker, A calculus of mobile processes, II, Information and Computation, vol.100, issue.1, pp.1-40, 1992.
DOI : 10.1016/0890-5401(92)90009-5

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

B. Nordström, K. Petersson, and J. Smith, Programming in Martin-Löf's Type Theory (out of print, but downloadable from www.cs.chalmers.se/Cs, 1990.

P. O. Hearn and D. Pym, Abstract, Bulletin of Symbolic Logic, vol.two, issue.02, pp.215-244, 1999.
DOI : 10.1016/0304-3975(93)90181-R

M. Pagani and L. , Strong normalization property for second order linear logic, Theoretical Computer Science, vol.411, issue.2, pp.410-444, 2010.
DOI : 10.1016/j.tcs.2009.07.053
URL : https://hal.archives-ouvertes.fr/hal-00698979

M. Parigot, ?µ-calculus: An algorithmic interpretation of classical natural deduction, Proc. of the Int. Conf. on Logic Programming and Automated Reasoning, 1992.

D. Pym and J. Harland, A Uniform Proof-theoretic Investigation of Linear Logic Programming, Journal of Logic and Computation, vol.4, issue.2, pp.175-207, 1994.
DOI : 10.1093/logcom/4.2.175

J. Reynolds, Towards a theory of type structure, Proc. Colloque sur la Programmation, pp.408-425, 1974.
DOI : 10.1007/3-540-06859-7_148

P. Wadler, Linear types can change the world, IFIP TC 2 Working Conference on Programming Concepts and Methods, pp.561-581, 1990.

G. Winskel and M. Nygaard, Linearity in process languages, Proc. Logic in Computer Science LICS'02, 2002.