B. Thomsen, A calculus of higher order communicating systems, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '89, pp.143-154, 1989.
DOI : 10.1145/75277.75290

B. Thomsen and C. Plain, Plain CHOCS A second generation calculus for higher order processes, Acta Informatica, vol.5, issue.2, pp.1-59, 1993.
DOI : 10.1007/BF01200262

D. Sangiorgi, Expressing mobility in process algebras: First-order and higherorder paradigms, Dept. of Comp. Sci, 1992.

B. Thomsen, Calculi for higher order communicating systems, Imperial College, 1990.

X. Xu, On the bisimulation theory and axiomatization of higher-order process calculi, 2007.

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

I. Phillips and M. G. Vigliotti, Symmetric electoral systems for ambient calculi, Information and Computation, vol.206, issue.1, pp.34-72, 2008.
DOI : 10.1016/j.ic.2007.08.005

D. Gorla, On the Relative Expressive Power of Calculi for Mobility, Electronic Notes in Theoretical Computer Science, vol.249, pp.269-286, 2009.
DOI : 10.1016/j.entcs.2009.07.094

M. Minsky, Computation: Finite and Infinite Machines, 1967.

A. Jeffrey and J. Rathke, Contextual equivalence for higher-order pi-calculus revisited, Logical Methods in Computer Science, vol.1, issue.1, pp.1-22, 2005.
DOI : 10.2168/LMCS-1(1:4)2005

Z. Cao, More on bisimulations for higher order pi-calculus, Proc. of FoS- SaCS'06, pp.63-78, 2006.

D. Sangiorgi, The lazy lambda calculus in a concurrency scenario, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, pp.120-153, 1994.
DOI : 10.1109/LICS.1992.185524

P. Jan?ar, Undecidability of bisimilarity for Petri nets and some related problems, Theoretical Computer Science, vol.148, issue.2, pp.281-301, 1995.
DOI : 10.1016/0304-3975(95)00037-W

P. Schnoebelen, Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems, Proc. of TACS'01, pp.385-399, 2001.
DOI : 10.1007/3-540-45500-0_19

A. Dovier, C. Piazza, and A. Policriti, An efficient algorithm for computing bisimulation equivalence, Theoretical Computer Science, vol.311, issue.1-3, pp.221-256, 2004.
DOI : 10.1016/S0304-3975(03)00361-X

R. Milner and F. Moller, Unique decomposition of processes, Theoretical Computer Science, vol.107, issue.2, pp.357-363, 1993.
DOI : 10.1016/0304-3975(93)90176-T

D. Hirschkoff and D. Pous, A distribution law for CCS and a new congruence result for the ?-calculus, Log. Meth. Comput. Sci, vol.4, issue.2
URL : https://hal.archives-ouvertes.fr/hal-00089219

E. L. Post, A variant of a recursively unsolvable problem, Bull. of the Am, Math. Soc, vol.52, pp.264-268, 1946.

M. Sipser, Introduction to the Theory of Computation, ACM SIGACT News, vol.27, issue.1, 2005.
DOI : 10.1145/230514.571645

D. Sangiorgi, Bisimulation for Higher-Order Process Calculi, Information and Computation, vol.131, issue.2, pp.141-178, 1996.
DOI : 10.1006/inco.1996.0096
URL : https://hal.archives-ouvertes.fr/inria-00074170

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

D. Sangiorgi, N. Kobayashi, and E. Sumii, Environmental bisimulations for higherorder languages, Proc. of LICS'07, pp.293-302, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01337665

R. Milner, Comunication and Concurrency, International Series in Computer Science, 1989.

D. J. Howe, Proving Congruence of Bisimulation in Functional Programming Languages, Information and Computation, vol.124, issue.2, pp.103-112, 1996.
DOI : 10.1006/inco.1996.0008

M. Baldamus and T. Frauenstein, Congruence proofs for weak bisimulation equivalences on higher-order process calculi, 1995.

M. Bundgaard, J. C. Godskesen, and T. Hildebrandt, Bisimulation congruences for homer ? a calculus of higher order mobile embedded resources, 2004.

J. C. Godskesen and T. T. Hildebrandt, Extending Howe???s Method to Early Bisimulations for Typed Mobile Embedded Resources with Local Names, Proc. of FSTTCS, pp.140-151, 2005.
DOI : 10.1007/11590156_11

S. Lenglet, A. Schmitt, and J. Stefani, Normal Bisimulations in Calculi with Passivation, Proc. of FOSSACS, pp.257-271, 2009.
DOI : 10.1007/978-3-540-31794-4_9
URL : https://hal.archives-ouvertes.fr/inria-00330565

S. Lenglet, A. Schmitt, and J. Stefani, Howe???s Method for Calculi with Passivation, Proc. of CONCUR, pp.448-462, 2009.
DOI : 10.1007/BF01200262

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

R. Milner and D. Sangiorgi, Barbed bisimulation, Proc. 19th ICALP, pp.685-695, 1992.
DOI : 10.1007/3-540-55719-9_114

R. M. Amadio, I. Castellani, and D. Sangiorgi, On bisimulations for the asynchronous ??-calculus, Theoretical Computer Science, vol.195, issue.2, pp.291-324, 1998.
DOI : 10.1016/S0304-3975(97)00223-5
URL : https://hal.archives-ouvertes.fr/inria-00073784

F. Moller, Axioms for concurrency, Dept. of Comp. Sci, 1989.

N. G. De-bruijn, Lambda calculus notation with nameless dummies: A tool for automatic formula manipulation, with application to the church-rosser theorem, Indagationes Mathematicae, vol.34, pp.381-392, 1972.

A. Ku?era and P. Jan?ar, Equivalence-Checking with Infinite-State Systems: Techniques and Results, pp.227-264, 2006.
DOI : 10.1007/3-540-36137-5_3

S. Christensen, Y. Hirshfeld, and F. Moller, Decidable Subsets of CCS, The Computer Journal, vol.37, issue.4, pp.233-242, 1994.
DOI : 10.1093/comjnl/37.4.233

V. Koutavas and M. Hennessy, First-order reasoning for higher-order concurrency, Computer Languages, Systems & Structures, vol.38, issue.3, 2010.
DOI : 10.1016/j.cl.2012.04.003

J. Vivas and M. Dam, From higher-order ??-calculus to ??-calculus in the presence of static operators, Proc. of CONCUR, pp.115-130, 1998.
DOI : 10.1007/BFb0055619

M. Bundgaard, J. C. Godskesen, and T. Hildebrandt, On encoding the pi-calculus in higher-order calculi, 2008.

M. Bundgaard, J. C. Godskesen, B. Haagensen, and H. Hüttel, Decidable Fragments of a Higher Order Calculus with Locations, Electronic Notes in Theoretical Computer Science, vol.242, issue.1, pp.113-138, 2009.
DOI : 10.1016/j.entcs.2009.06.016

J. C. Shepherdson and H. E. Sturgis, Computability of Recursive Functions, Journal of the ACM, vol.10, issue.2, pp.217-255, 1963.
DOI : 10.1145/321160.321170

N. Busi, M. Gabbrielli, and G. Zavattaro, Replication vs. Recursive Definitions in Channel Based Calculi, Proc. of ICALP, pp.133-144, 2003.
DOI : 10.1007/3-540-45061-0_12

N. Busi, M. Gabbrielli, and G. Zavattaro, On the expressive power of recursion, replication and iteration in process calculi, Mathematical Structures in Computer Science, vol.2987, issue.06, pp.1191-1222, 2009.
DOI : 10.1145/321160.321170

N. Busi and G. Zavattaro, On the expressive power of movement and restriction in pure mobile ambients, Theoretical Computer Science, vol.322, issue.3, pp.477-515, 2004.
DOI : 10.1016/j.tcs.2003.10.040

M. Nielsen, C. Palamidessi, and F. D. Valencia, On the expressive power of temporal concurrent constraint programming languages, Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming , PPDP '02, pp.156-167, 2002.
DOI : 10.1145/571157.571173

W. Charatonik and J. Talbot, The Decidability of Model Checking Mobile Ambients, Proc. of CSL, pp.339-354, 2001.
DOI : 10.1007/3-540-44802-0_24

J. A. Pérez, Higher-Order Concurrency: Expressiveness and Decidability Results, 2010.

C. Di-giusto, J. A. Pérez, and G. Zavattaro, On the Expressiveness of Forwarding in Higher-Order Communication, Proc. of ICTAC, pp.155-169, 2009.
DOI : 10.1007/978-3-642-03466-4_10

I. Lanese, J. A. Pérez, D. Sangiorgi, and A. Schmitt, On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi, Proc. of ICALP'10, pp.442-453, 2010.
DOI : 10.1007/978-3-642-14162-1_37
URL : https://hal.archives-ouvertes.fr/inria-00514912

A. Schmitt and J. Stefani, The Kell Calculus: A Family of Higher-Order Distributed Process Calculi, Global Computing, pp.146-178, 2005.
DOI : 10.1007/3-540-45694-5_19