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

S. Abramsky, Interaction Categories, Theory and Formal Methods, Workshops in Computing, pp.57-69, 1993.
DOI : 10.1007/978-1-4471-3503-6_5

S. Abramsky, P. Malacaria, and R. Jagadeesan, Full Abstraction for PCF, International Symposium on Theoretical Aspects of Computer Science (TACS), pp.1-15, 1994.
DOI : 10.1006/inco.2000.2930

URL : http://doi.org/10.1006/inco.2000.2930

A. Asperti and G. Dore, Yet another correctness criterion for Multiplicative Linear Logic with MIX, Third international symposium on logical foundations of computer science, pp.34-46, 1994.
DOI : 10.1007/3-540-58140-5_5

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.898

E. Beffara, Realizability with constants
URL : https://hal.archives-ouvertes.fr/hal-00003724

E. Beffara, A Concurrent Model for Linear Logic, 21st International Conference on Mathematical Foundations of Programming Semantics (MFPS), Electronic Notes in Theoretical Computer Science, 2005.
DOI : 10.1016/j.entcs.2005.11.055

URL : https://hal.archives-ouvertes.fr/hal-00151820

E. Beffara and V. Danos, Disjunctive normal forms and local exceptions, 8th ACM International Conference on Functional Programming (ICFP), pp.203-211, 2003.
DOI : 10.1145/944705.944724

URL : https://hal.archives-ouvertes.fr/hal-00009191

E. Beffara and F. Maurel, Concurrent nets: A study of prefixing in process calculi, Theoretical Computer Science, vol.356, issue.3, 2005.
DOI : 10.1016/j.tcs.2006.02.009

URL : https://hal.archives-ouvertes.fr/hal-00009192

E. Beffara and F. Maurel, Concurrent Nets, 11th International Workshop on Expressiveness in Concurrency (EXPRESS), pp.67-86, 2005.
DOI : 10.1016/j.entcs.2004.11.029

URL : https://hal.archives-ouvertes.fr/hal-00462484

G. Bellin and P. J. 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

M. Berger, K. Honda, and N. Yoshida, Sequentiality and the ?-calculus The chemical abstract machine, 5th International Conference on Typed Lambda Calculi and Applications (TLCA) 17th ACM Symposium on Principles of Programming Languages (POPL), pp.81-94, 1990.

M. Boreale, On the expressiveness of internal mobility in name-passing calculi, Theoretical Computer Science, vol.195, issue.2, pp.205-226, 1998.
DOI : 10.1016/S0304-3975(97)00220-X

M. Boreale, R. De, and N. , Testing Equivalence for Mobile Processes, Information and Computation, vol.120, issue.2, pp.279-303, 1995.
DOI : 10.1006/inco.1995.1114

URL : http://doi.org/10.1006/inco.1995.1114

G. Boudol and C. Laneve, The discriminating power of multiplicities in the ?-calculus. Information and Computation, pp.83-102, 1996.
URL : https://hal.archives-ouvertes.fr/inria-00074234

L. Caires and L. Cardelli, A Spatial Logic for Concurrency (Part II), Theoretical Computer Science, vol.322, issue.3, pp.517-565, 2004.
DOI : 10.1007/3-540-45694-5_15

P. Curien and H. Herbelin, The duality of computation, 5th ACM International Conference on Functional Programming (ICFP), pp.233-243, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00156377

M. Dam, Process-Algebraic Interpretations of Positive Linear and Relevant Logics, Journal of Logic and Computation, vol.4, issue.6, pp.939-973, 1994.
DOI : 10.1093/logcom/4.6.939

V. Danos, H. Herbelin, and L. Regnier, Game semantics and abstract machines, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, 1996.
DOI : 10.1109/LICS.1996.561456

V. Danos, J. , and H. Schellinx, LKQ and LKT: Sequent calculi for second order logic based upon linear decomposition of classical implication, éditeurs, Advances in Linear Logic, pp.211-224, 1995.

V. Danos, J. , and H. Schellinx, Abstract, The Journal of Symbolic Logic, vol.II, issue.03, pp.755-807, 1996.
DOI : 10.1007/BF00885763

URL : https://hal.archives-ouvertes.fr/inria-00528352

V. Danos and J. Krivine, Disjunctive Tautologies as Synchronisation Schemes, Peter Clote et Helmut Schwichtenberg 14th Annual Conference of the European Association for Computer Science Logic (CSL), numéro 1862 in Lecture Notes in Computer Science, pp.292-301, 2000.
DOI : 10.1007/3-540-44622-2_19

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.2792

V. Danos and L. Regnier, The structure of multiplicatives, Archive for Mathematical Logic, vol.28, issue.3, pp.181-203, 1989.
DOI : 10.1007/BF01622878

V. Danos and L. Regnier, How abstract machines implement head linear reduction, 2003.

R. De, N. , and M. Hennessy, Testing equivalence for processes, 10th International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science, pp.548-560, 1983.

G. Dowek, T. Hardin, and C. Kirchner, Theorem proving modulo, Journal of Automated Reasoning, 2003.
URL : https://hal.archives-ouvertes.fr/hal-01199506

T. Ehrhard and L. Regnier, Differential interaction nets, Workshop on Logic, Language, Information and Computation, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00150274

M. Felleisen, D. P. Friedman, E. E. Kohlbecker, F. Bruce, and . Duba, A syntactic theory of sequential control, Theoretical Computer Science, vol.52, issue.3, pp.205-237, 1987.
DOI : 10.1016/0304-3975(87)90109-5

A. Fleury and C. Rétoré, The mix rule, Mathematical Structures in Computer Science, vol.28, issue.02, pp.173-185, 1994.
DOI : 10.1016/0304-3975(93)90181-R

C. Fournet and G. Gonthier, The reflexive CHAM and the join-calculus, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '96, pp.372-385, 1996.
DOI : 10.1145/237721.237805

Y. Fu, The ?-calculus, Advances in Parallel and Distributed Computing Conference (APDC), pp.74-81, 1997.
URL : https://hal.archives-ouvertes.fr/hal-00155354

Y. Fu, A proof theoretical approach to communication, 24th International Colloquium on Automata, Languages and Programming (ICALP), pp.325-335, 1997.
DOI : 10.1007/3-540-63165-8_189

P. Gardner, C. Laneve, and L. Wischik, Linear Forwarders, Lecture Notes in Computer Science, vol.2761, pp.415-430, 2003.
DOI : 10.1007/978-3-540-45187-7_27

P. Gardner and L. Wischik, Explicit Fusions, Mogens Nielsen et Branislav Rovan, éditeurs, 25th International Symposium on Mathematical Foundations of Computer Science (MFCS), pp.373-382, 2000.
DOI : 10.1007/3-540-44612-5_33

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

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, Linear Logic: its syntax and semantics, éditeurs, Advances in Linear Logic, pp.1-42, 1995.
DOI : 10.1017/CBO9780511629150.002

J. Girard, Proof-nets: The parallel syntax for proof-theory, Paolo Agliano et Aldo Ursini, éditeurs, Logic and Algebra. M. Dekker, 1996.

J. Girard, Y. Lafont, and P. Taylor, Proofs and types, 1989.

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

M. Hennessy and R. Milner, Algebraic laws for nondeterminism and concurrency, Journal of the ACM, vol.32, issue.1, pp.137-161, 1985.
DOI : 10.1145/2455.2460

K. Honda and N. Yoshida, On reduction-based process semantics, Theoretical Computer Science, vol.151, issue.2, pp.437-486, 1995.
DOI : 10.1016/0304-3975(95)00074-7

K. Honda, N. Yoshida, and M. Berger, Control in the ?calculus, 4th ACM-SIGPLAN Continuation Workshop, 2004.

J. Martin, E. Hyland, and C. Ong, Pi-calculus, dialogue games and PCF, 7th ACM Conference on Functional Programming Languages and Computer Architecture, pp.96-107, 1995.

J. Martin, E. Hyland, and C. Ong, On full abstraction for PCF (parts I, II and III) Information and Computation, pp.285-408, 2000.

O. Høgh, J. , and R. Milner, Bigraphs and transitions, ACM SIGPLAN Notices, vol.38, issue.1, pp.38-49, 2003.

G. Kreisel, On the interpretation of non-finitist proofs (part I), Journal of Symbolic Logic, vol.16, issue.4, pp.241-267, 1951.

J. Krivine, A general storage theorem for integers in call-by-name ??-calculus, Theoretical Computer Science, vol.129, issue.1, pp.79-94, 1994.
DOI : 10.1016/0304-3975(94)90081-7

J. Krivine, Typed lambda-calculus in classical Zermelo-Fr??nkel set theory, Archive for Mathematical Logic, vol.40, issue.3, pp.189-205, 2001.
DOI : 10.1007/s001530000057

J. Krivine, Dependent choice, ???quote??? and the clock, Theoretical Computer Science, vol.308, issue.1-3, pp.259-276, 2003.
DOI : 10.1016/S0304-3975(02)00776-4

URL : https://hal.archives-ouvertes.fr/hal-00154478

J. Krivine, Realizability in classical logic. Cours d'école doctorale, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00154500

Y. Lafont, Interaction nets, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '90, pp.95-108, 1990.
DOI : 10.1145/96709.96718

C. Laneve, J. Parrow, and B. Victor, Solo Diagrams, Naoki Kobayashi et Benjamin C. Pierce, éditeurs, 4th International Symposium on Theoretical Aspects of Computer Science (TACS), pp.127-144, 2001.
DOI : 10.1007/3-540-45500-0_6

C. Laneve and B. Victor, Solos in Concert, Ji?í Wiederman, Peter van Emde Boas et Mogens Nielsen, éditeurs, 26th International Colloquium on Automata, Languages and Programming (ICALP), pp.513-523, 1999.
DOI : 10.1007/3-540-48523-6_48

C. Laneve and B. Victor, Solos in concert, Mathematical Structures in Computer Science, vol.13, issue.5, pp.657-683, 2003.
DOI : 10.1017/S0960129503004055

O. Laurent, Étude de la polarisation en logique, Thèse de doctorat, 2002.

X. Leroy, D. Doligez, and J. Garrigue, Didier Rémy et Jérôme Vouillon. The Objective Caml system. INRIA, 2004.

J. Mccarthy, A basis for a mathematical theory of computation. Computer Programming and Formal Systems, pp.33-70, 1963.

R. Milner, Functions as processes, 17th International Colloquium on Automata, Languages and Programming (ICALP), pp.167-180, 1990.
URL : https://hal.archives-ouvertes.fr/inria-00075405

R. Milner, Pi-nets: A graphical form of ??-calculus, Donald Sannella , éditeur, 5th European Symposium on Programming (ESOP), pp.26-42, 1994.
DOI : 10.1007/3-540-57880-3_2

R. Milner, J. Parrow, and D. Walker, Modal logics for mobile processes, Theoretical Computer Science, vol.114, issue.1, pp.149-171, 1993.
DOI : 10.1016/0304-3975(93)90156-N

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.125.6980

O. Peter, D. Hearn, and . Pym, The logic of bunched implication, Bulletin of Symbolic Logic, vol.5, issue.2, pp.215-244, 1999.

C. Ong and C. A. Stewart, A Curry-Howard foundation for functional computation with control, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '97, 1997.
DOI : 10.1145/263699.263722

M. Parigot, ????-Calculus: An algorithmic interpretation of classical natural deduction, 3rd International Conference on Logic Programming and Automated Reasoning (LPAR), pp.190-201, 1992.
DOI : 10.1007/BFb0013061

J. Parrow, Trios in concert Colin Stirling et Mads Tofte, éditeurs, Proof, Language and Interaction: Essays in Honour of Robin Milner, pp.621-637, 1998.

J. Parrow and B. Victor, The fusion calculus: expressiveness and symmetry in mobile processes, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226), pp.176-185, 1998.
DOI : 10.1109/LICS.1998.705654

G. Plotkin, Call-by-name, call-by-value and the ??-calculus, Theoretical Computer Science, vol.1, issue.2, pp.125-159, 1975.
DOI : 10.1016/0304-3975(75)90017-1

URL : http://doi.org/10.1016/0304-3975(75)90017-1

L. Regnier, Une ??quivalence sur les lambda- termes, Theoretical Computer Science, vol.126, issue.2, pp.281-292, 1994.
DOI : 10.1016/0304-3975(94)90012-4

URL : http://doi.org/10.1016/0304-3975(94)90012-4

D. Sangiorgi, An investigation into functions as processes, 9th International Conference on Mathematical Foundations of Programming Semantics (MFPS), pp.143-159, 1994.
DOI : 10.1007/3-540-58027-1_7

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.6292

D. Sangiorgi, ??-Calculus, internal mobility, and agent-passing calculi, Theoretical Computer Science, vol.167, issue.1-2, pp.235-274, 1996.
DOI : 10.1016/0304-3975(96)00075-8

URL : http://doi.org/10.1016/0304-3975(96)00075-8

D. Sangiorgi and D. Walker, The ?-calculus: A Theory of Mobile Processes, 2001.

G. Winskel, Event structures In Advances in Petri nets: applications and relationships to other models of concurrency, pp.325-392, 1987.

N. Yoshida, M. Berger, and K. Honda, Strong normalisation in the ?-calculus, 16th IEEE Symposium on Logic in Computer Science (LICS), pp.311-322, 2001.