R. M. Amadio, G. Boudol, and C. Lhoussaine, The receptive distributed picalculus, 1999.
URL : https://hal.archives-ouvertes.fr/inria-00072553

M. Baldamus, Semantics and Logic of Higher-Order Processes : Characterizing Late Context Bisimulation, 1998.

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

K. L. Bernstein, A congruence theorem for structured operational semantics of higherorder languages, LICS '98, pp.153-164, 1997.

F. Bonchi, F. Gadducci, and G. V. Monreale, Reactive Systems, Barbed Semantics, and the Mobile Ambients, FOSSACS '09, pp.272-287, 2009.
DOI : 10.1007/978-3-540-71389-0_22

E. Bruneton, T. Coupaye, M. Leclercq, V. Quéma, and J. Stefani, An Open Component Model and Its Support in Java, CBSE '04, pp.7-22, 2004.
DOI : 10.1007/978-3-540-24774-6_3

M. Bugliesi and G. Castagna, Secure safe ambients, POPL '01, pp.222-235, 2001.
DOI : 10.1145/373243.360223

M. Bugliesi, S. Crafa, M. Merro, and V. Sassone, Communication and mobility control in boxed ambients, Information and Computation, vol.202, issue.1, 2005.
DOI : 10.1016/j.ic.2005.06.002

Z. Cao, More on bisimulations for higher order pi-calculus, FoSSaCS '06, pp.63-78, 2006.

L. Cardelli and A. D. Gordon, Mobile ambients, FoSSaCS '98, pp.140-155, 1998.
DOI : 10.1016/s1571-0661(05)80699-1
URL : http://doi.org/10.1016/s1571-0661(05)80699-1

G. Castagna and F. Z. Nardelli, The Seal Calculus Revisited: Contextual Equivalence and Bisimilarity, FSTTCS '02, pp.85-96, 2002.
DOI : 10.1007/3-540-36206-1_9

G. Castagna, J. Vitek, and F. Z. Nardelli, The Seal Calculus, Information and Computation, vol.201, issue.1, pp.1-54, 2005.
DOI : 10.1016/j.ic.2004.11.005
URL : https://hal.archives-ouvertes.fr/hal-00152521

C. Fournet and G. Gonthier, The Join Calculus: A Language for Distributed Mobile Programming, Applied Semantics Summer School, pp.268-332, 2000.
DOI : 10.1007/3-540-45699-6_6

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

A. D. Gordon, Bisimilarity as a theory of functional programming. Mini-course. Notes Series NS-95-3, 1995.

J. F. Groote, Transition system specifications with negative premises, Theoretical Computer Science, vol.118, issue.2, pp.263-299, 1993.
DOI : 10.1016/0304-3975(93)90111-6

D. Hausmann, T. Mossakowski, and L. Schröder, A coalgebraic approach to the semantics of the ambient calculus, Theoretical Computer Science, vol.366, issue.1-2, pp.121-143, 2006.
DOI : 10.1016/j.tcs.2006.07.006

M. Hennessy and J. Riely, Resource access control in systems of mobile agents, Information and Computation, vol.173, 1998.

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

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

A. Jeffrey and J. Rathke, A theory of bisimulation for a fragment of Concurrent ML with local names, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332), pp.1-48, 2004.
DOI : 10.1109/LICS.2000.855780

A. Jeffrey and J. Rathke, Contextual equivalence for higher-order pi-calculus revisited, Logical Methods in Computer Science, vol.1, issue.1, 2005.
DOI : 10.2168/LMCS-1(1:4)2005
URL : http://arxiv.org/abs/cs/0503067

I. Lanese, J. A. Pérez, D. Sangiorgi, and A. Schmitt, On the expressiveness and decidability of higher-order process calculi, LICS, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00494584

J. J. Leifer and R. Milner, Deriving Bisimulation Congruences for Reactive Systems, CONCUR '00, pp.243-258, 2000.
DOI : 10.1007/3-540-44618-4_19

S. Lenglet, A. Schmitt, and J. Stefani, Normal bisimulations in process calculi with passivation, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00330565

S. Lenglet, A. Schmitt, and J. B. Stefani, Howe's method for early bisimilarities, 2008.

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

S. Lenglet, A. Schmitt, and J. Stefani, Normal bisimulations in process calculi with passivation, FoSSaCS '09, pp.257-271, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00330565

F. Levi and D. Sangiorgi, Mobile safe ambients, ACM Transactions on Programming Languages and Systems, vol.25, issue.1, pp.1-69, 2003.
DOI : 10.1145/596980.596981

Y. Li, Contextual Labelled Semantics for Higher-order Process Calculi, FGUC '04, pp.61-77, 2005.
DOI : 10.1016/j.entcs.2005.05.005

Y. Li and X. Liu, Towards a theory of bisimulation for the higher-order process calculi, Journal of Computer Science and Technology, vol.131, issue.2, pp.352-363, 2004.
DOI : 10.1007/BF02944905

M. Merro and F. Z. Nardelli, Behavioral theory for mobile ambients, Journal of the ACM, vol.52, issue.6, pp.961-1023, 2005.
DOI : 10.1145/1101821.1101825

R. Milner, A Calculus of Communicating Systems, 1980.
DOI : 10.1007/3-540-10235-3

R. Milner, J. Parrow, and D. Walker, A calculus of mobile processes, i. Information and Computation, pp.1-40, 1992.

R. Milner and D. Sangiorgi, Barbed bisimulation, ICALP '92, 1992.
DOI : 10.1007/3-540-55719-9_114

R. Milner and D. Sangiorgi, Techniques of weak bisimulation up-to, CONCUR '92, 1992.

M. Mousavi, M. J. Gabbay, and M. A. Reniers, Sos for higher order processes (extended abstract), CONCUR'05, pp.308-322, 2005.

D. Pous, Up-to Techniques for Weak Bisimulation, ICALP '05, pp.730-741, 2005.
DOI : 10.1007/11523468_59
URL : https://hal.archives-ouvertes.fr/hal-01441463

J. Rathke and P. Sobocinski, Deconstructing behavioural theories of mobility, IFIP TCS '08, pp.507-520, 2008.
DOI : 10.1007/978-0-387-09680-3_34

J. Rathke and P. Sobocinski, Deriving structural labelled transitions for mobile ambients, CONCUR '08, pp.462-476, 2008.
DOI : 10.1016/j.ic.2010.06.001
URL : http://doi.org/10.1016/j.ic.2010.06.001

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

D. Sangiorgi, Bisimulation for higher-order process calculi. Information and Computation, pp.141-178, 1996.
DOI : 10.1006/inco.1996.0096
URL : https://hal.archives-ouvertes.fr/inria-00074170

D. Sangiorgi, On the bisimulation proof method, Mathematical Structures in Computer Science, vol.8, issue.5, pp.447-479, 1998.
DOI : 10.1017/S0960129598002527

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

D. Sangiorgi and D. Walker, The Pi-Calculus : A Theory of Mobile Processes, 2001.

A. Schmitt and J. Stefani, The m-calculus : A higher-order distributed process calculus, POPL'03, pp.50-61, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00072227

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

P. Sewell, J. Leifer, K. Wansbrough, F. Zappa-nardelli, M. Allen-willians et al., Acute : High-level programming language design for distributed computation, Journal of Functional Programming, vol.17, pp.4-5, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00070671

E. Sumii, A Theory of Non-monotone Memory (Or: Contexts for free), ESOP '09, pp.237-251, 2009.
DOI : 10.1007/978-3-642-00590-9_18

E. Sumii and B. C. Pierce, A bisimulation for type abstraction and recursion, ACM SIGPLAN Notices, vol.40, issue.1, pp.63-74, 2005.
DOI : 10.1145/1047659.1040311

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, Plain CHOCS A second generation calculus for higher order processes, Acta Informatica, vol.5, issue.2, pp.1-59, 1993.
DOI : 10.1007/BF01200262

C. Verhoef, A congruence theorem for structured operational semantics with predicates and negative premises, Nordic Journal of Computing, vol.2, issue.2, pp.274-302, 1995.

J. Vitek and G. Castagna, Seal: A Framework for Secure Mobile Computations, ICCL'98 : Workshop on Internet Programming Languages, pp.47-77, 1999.
DOI : 10.1007/3-540-47959-7_3

S. and D. Zilio, Mobile processes : a commented bibliography In Modeling and verification of parallel processes, LNCS, vol.2067, pp.206-222, 2001.