M. Abadi, &. Andrew, and D. Gordon, A Calculus for Cryptographic Protocols: The spi Calculus, Information and Computation, vol.148, issue.1, pp.1-70, 1999.

B. Accattoli, A Fresh Look at the lambda-Calculus (Invited Talk), Leibniz International Proceedings in Informatics 131, Schloss Dagstuhl -Leibniz-Zentrum für Informatik, vol.1, p.20, 2019.

R. M. Amadio, Operational methods in semantics. draft of lecture notes, 2016.
URL : https://hal.archives-ouvertes.fr/cel-01422101

, How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation, CONCUR, LIPIcs 2017, Schloss Dagstuhl -Leibniz-Zentrum für Informatik, vol.13, p.23, 2020.

, Handbook of Process Algebra, 2001.

M. Bognar, Contexts in Lambda Calculus, 2002.

M. Boreale and &. Nicola, Testing Equivalence for Mobile Processes, Information and Computation, vol.120, issue.2, pp.279-303, 1995.

F. Breuvart, Dissecting denotational semantics, 2015.

A. Bucciarelli, A. Carraro, T. Ehrhard-&-giulio, and . Manzonetto, Full Abstraction for Resource Calculus with Tests, Leibniz International Proceedings in Informatics (LIPIcs) 12, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, pp.97-111, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00707814

V. Danos-&-jean-krivine, Reversible Communicating Systems, CONCUR, vol.3170, pp.292-307, 2004.

S. Davide, The Name Discipline of Uniform Receptiveness, Theoretical Computer Science, vol.221, issue.1-2, pp.457-493, 1999.

S. Davide, Pi-Calculus, Encyclopedia of Parallel Computing, pp.1554-1562, 2011.

, Advanced Topics in Bisimulation and Coinduction. Cambridge Tracts in Theoretical Computer Science, 2011.

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

R. Matthew-de-nicola and . Hennessy, Testing Equivalences for Processes, Theoretical Computer Science, vol.34, pp.83-133, 1984.

R. De-nicola, U. Montanari-&-frits, and W. Vaandrager, Back and Forth Bisimulations, CONCUR '90, vol.458, pp.152-165, 1990.

, A calculus of communicating systems with label passing -ten years after, Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp.599-622, 2000.

, Lambda Calculus and Probabilistic Computation, LICS, IEEE, pp.1-13, 2019.

A. D. Gordon-&-luca-cardelli, Equational Properties Of Mobile Ambients, Mathematical Structures in Computer Science, vol.13, issue.3, pp.371-408, 2003.

M. Hashimoto-&-atsushi and . Ohori, A typed context calculus, Theoretical Computer Science, vol.266, issue.1-2, pp.249-272, 2001.

M. Hennessy, A distributed Pi-calculus, 2007.

,

C. Hewitt, P. B. Bishop, I. Greif, B. C. Smith, T. Matson-&-richard et al., Actor Induction and Meta-Evaluation, pp.153-168, 1973.

K. Honda and &. Yoshida, On Reduction-Based Process Semantics, Theoretical Computer Science, vol.151, issue.2, pp.437-486, 1995.

I. Lanese, M. Lienhardt, C. A. Mezzina, A. Schmitt, and &. Stefani, Concurrent Flexible Reversibility, vol.7792, pp.370-390, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00811629

I. Lanese and D. Medi?-&-claudio-antares-mezzina, Static versus dynamic reversibility in CCS. Acta Informatica, 2019.

J. Madiot, Higher-order languages: dualities and bisimulation enhancements, 2015.
URL : https://hal.archives-ouvertes.fr/tel-01141067

M. Merro and &. Nardelli, Behavioral theory for mobile ambients, Journal of the ACM, vol.52, issue.6, pp.961-1023, 2005.

R. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science, 1980.

R. Milner, Communication and Concurrency. PHI Series in computer science, 1989.

R. Milner, Elements of Interaction: Turing Award Lecture, Communications of the ACM, vol.36, issue.1, p.7889, 1993.

R. Milner-&-sangiorgi and D. , Barbed Bisimulation, Lecture Notes in Computer Science, vol.623, pp.685-695, 1992.

R. Milner and J. Walker, A Calculus of Mobile Processes, I. Information and Computation, vol.100, issue.1, pp.1-40, 1992.

R. Milner and J. Walker, A Calculus of Mobile Processes, II. Information and Computation, vol.100, issue.1, pp.41-77, 1992.

M. Nielsen-&-christian-clausen, Bisimulation for Models in Concurrency, CONCUR '94, vol.836, pp.385-400, 1994.

M. Nielsen, U. Engberg, &. Kim, and S. Larsen, Fully abstract models for a process language with refinement, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, vol.354, pp.523-548, 1988.

C. Palamidessi, &. Frank, and D. Valencia, Recursion vs Replication in Process Calculi: Expressiveness. Bulletin of the European Association for Theoretical Computer Science, vol.87, pp.105-125, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00201158

. Andr-van-tondervan, A Lambda Calculus for Quantum Computation, SIAM Journal on Computing, vol.33, issue.5, pp.1109-1135, 2004.

C. A. Varela, Programming Distributed Computing Systems: A Foundational Approach, 2013.

W. Yi, CCS + Time = An Interleaving Model for Real Time Systems, vol.510, pp.217-228, 1991.