M. Abadi and A. Gordon, A calculus for cryptographic protocols, Proceedings of the 4th ACM conference on Computer and communications security , CCS '97, pp.36-47, 1997.
DOI : 10.1145/266420.266432

S. Abramsky, The lazy lambda calculus Research topics in functional programming, pp.65-116, 1990.

P. Audebaud, Explicit Substitutions for the ?µ Calculus, 1994.

S. Van-bakel, Completeness and partial soundness results for intersection and union typing for <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mover accent="false"><mml:mrow><mml:mi>?</mml:mi></mml:mrow><mml:mo accent="true">?</mml:mo></mml:mover><mml:mi>?</mml:mi><mml:mover accent="true"><mml:mrow><mml:mi>?</mml:mi></mml:mrow><mml:mrow><mml:mo>?</mml:mo></mml:mrow></mml:mover></mml:math>, Annals of Pure and Applied Logic, vol.161, issue.11, pp.1400-1430, 2010.
DOI : 10.1016/j.apal.2010.04.010

S. Van-bakel, Completeness and Soundness results for X with Intersection and Union Types, Fundamenta Informaticae, 2012.

S. Van-bakel, F. Barbanera, and U. Liguoro, A Filter Model for ?µ, TLCA'11, pp.213-228, 2011.

S. Van-bakel, L. Cardelli, and M. G. Vigliotti, From X to ?; Representing the Classical Sequent Calculus in the ?calculus, 2008.

S. Van-bakel and P. Lescanne, Computation with classical sequents, Mathematical Structures in Computer Science, vol.822, issue.03, pp.555-609, 2008.
DOI : 10.1007/3-540-58216-9_27

S. Van-bakel and M. G. Vigliotti, A Logical Interpretation of the ?-Calculus into the ?-Calculus, Preserving Spine Reduction and Types, CONCUR'09, pp.84-98, 2009.
DOI : 10.1007/3-540-58027-1_7

H. Barendregt, The Lambda Calculus: its Syntax and Semantics, 1984.

R. Bloo and K. H. Rose, Preservation of Strong Normalisation in Named Lambda Calculi with Explicit Substitution and Garbage Collection, pp.62-72, 1995.

N. G. De-bruijn, Lambda Calculus Notation with Nameless Dummies: A Tool for Automatic Formula Manipulation, with Application to the Church-Rosser Theorem, Ind. Math, vol.34, pp.381-392, 1972.

M. Cimini, C. Sacerdoti-coen, and D. Sangiorgi, ?µ?µ?µ? ?µ?µ calculus, ?-calculus, and abstract machines, p.9, 2009.

T. Crolard, A confluent lambda-calculus with a catch/throw mechanism, JFP, vol.9, issue.6, pp.625-647, 1999.
URL : https://hal.archives-ouvertes.fr/hal-00094601

P. Curien and H. Herbelin, The Duality of Computation, pp.233-243, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00156377

G. Gentzen, Investigations into logical deduction. The Collected Papers of Gerhard Gentzen, p.68, 1935.

. Ph and . De-groote, On the relation between the ?µ-calculus and the syntactic theory of sequential control, LPAR'94, pp.31-43, 1994.

H. Herbelin, C'est maintenant qu'on calcule: au coeur de la dualité. Mémoire d'habilitation, 2005.

K. Honda and M. Tokoro, An object calculus for asynchronous communication, ECOOP'91, pp.133-147, 1991.
DOI : 10.1007/BFb0057019
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.4500

S. B. Lassen, Head Normal Form Bisimulation for Pairs and the ?µ-Calculus, LICS'06, pp.297-306, 2006.
DOI : 10.1109/lics.2006.29

R. Milner, Functions as processes, MSCS, vol.2, issue.2, pp.269-310, 1992.
DOI : 10.1007/bfb0032030
URL : https://hal.archives-ouvertes.fr/inria-00075405

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

M. Parigot, Strong normalization for second order classical natural deduction, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science, pp.39-46, 1993.
DOI : 10.1109/LICS.1993.287602

B. C. Pierce and D. Sangiorgi, Typing and subtyping for mobile processes, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science, pp.409-453, 1996.
DOI : 10.1109/LICS.1993.287570
URL : http://basics.sjtu.edu.cn/~yuehg/lics/1993 typing and subtyping for mobile processes.pdf

W. Py, Confluence en ?µ-calcul, 1998.

D. Sangiorgi, Expressing Mobility in Process Algebra: First Order and Higher Order Paradigms, 1992.

D. Sangiorgi, Lazy functions and mobile processes, 1995.
URL : https://hal.archives-ouvertes.fr/inria-00074163

D. Sangiorgi and D. Walker, The Pi-Calculus, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00073650

P. Sestoft, Demonstrating Lambda Calculus Reduction. The Essence of Computation, LNCS, vol.2566, pp.420-435, 2001.
DOI : 10.1016/s1571-0661(04)80973-3
URL : http://doi.org/10.1016/s1571-0661(04)80973-3

C. P. Wadsworth, The relation between computational and denotational properties for Scott's D ? -models of the lambdacalculus, SIAM JoC, vol.5, pp.488-521, 1976.