References

  1. Martín Abadi, Bruno Blanchet & Cédric Fournet (2018): The Applied Pi Calculus: Mobile Values, New Names, and Secure Communication. J. ACM 65(1), pp. 1:1–1:41, doi:10.1145/3127586.
  2. Martín Abadi & Andrew D. Gordon (1999): A Calculus for Cryptographic Protocols: The spi Calculus. Inf. Comput. 148(1), pp. 1–70, doi:10.1006/inco.1998.2740.
  3. Carmine Abate, Roberto Blanco, Deepak Garg, Catalin Hritcu, Marco Patrignani & Jérémy Thibault (2019): Journey Beyond Full Abstraction: Exploring Robust Property Preservation for Secure Compilation. In: 32nd IEEE Computer Security Foundations Symposium, CSF 2019, Hoboken, NJ, USA, June 25-28, 2019. IEEE, pp. 256–271, doi:10.1109/CSF.2019.00025.
  4. Beniamino Accattoli (2013): Evaluating functions as processes. In: Rachid Echahed & Detlef Plump: TERMGRAPH 2013, EPTCS 110, pp. 41–55, doi:10.4204/EPTCS.110.6.
  5. Beniamino Accattoli (2019): A Fresh Look at the lambda-Calculus (Invited Talk). In: Herman Geuvers: CSL, LIPIcs 131. Schloss Dagstuhl, pp. 1:1–1:20, doi:10.4230/LIPIcs.FSCD.2019.1.
  6. Beniamino Accattoli & Ugo Dal Lago (2014): Beta reduction is invariant, indeed. In: Thomas A. Henzinger & Dale Miller: CSL. ACM, pp. 8, doi:10.1145/2603088.2603105.
  7. Beniamino Accattoli & Ugo Dal Lago (2012): On the Invariance of the Unitary Cost Model for Head Reduction. In: Ashish Tiwari: 23rd International Conference on Rewriting Techniques and Applications (RTA'12), RTA 2012, May 28 - June 2, 2012, Nagoya, Japan, LIPIcs 15. Schloss Dagstuhl, pp. 22–37, doi:10.4230/LIPIcs.RTA.2012.22.
  8. Roberto M. Amadio (2016): Operational methods in semantics. Lecture notes. Université Denis Diderot Paris 7. Available at https://hal.archives-ouvertes.fr/cel-01422101.
  9. Clément Aubert & Ioana Cristescu (2020): How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation. In: Igor Konnov & Laura Kovács: CONCUR, LIPIcs 2017. Schloss Dagstuhl, pp. 13:1–13:24, doi:10.4230/LIPIcs.CONCUR.2020.13.
  10. Clément Aubert & Doriana Medi\'c (2021): Explicit Identifiers and Contexts in Reversible Concurrent Calculus. In: Shigeru Yamashita & Tetsuo Yokoyama: Reversible Computation - 13th International Conference, RC 2021, Virtual Event, July 7-8, 2021, Proceedings, LNCS 12805. Springer, pp. 144–162, doi:10.1007/978-3-030-79837-6_9.
  11. Kushal Babel, Vincent Cheval & Steve Kremer (2020): On the semantics of communications when verifying equivalence properties. Journal of Computer Security 28, pp. 71–127, doi:10.3233/JCS-191366. 1.
  12. David Baelde (2021): Contributions à la Vérification des Protocoles Cryptographiques. Habilitation à diriger des recherches. Université Paris-Saclay. Available at http://www.lsv.fr/~baelde/hdr/habilitation_baelde.pdf.
  13. Hendrik Pieter Barendregt (1984): The Lambda Calculus Its Syntax and Semantics. Studies in Logic and the Foundations of Mathematics 103. North-Holland, doi:10.1016/B978-0-444-87508-2.50006-X.
  14. Emmanuel Beffara & Virgile Mogbil (2012): Proofs as executions. In: Jos C. M. Baeten, Thomas Ball & Frank S. de Boer: IFIP TCS, LNCS 7604. Springer, pp. 280–294, doi:10.1007/978-3-642-33475-7_20.
  15. Jan A. Bergstra, Alban Ponse & Scott A. Smolka (2001): Handbook of Process Algebra. Elsevier Science, Amsterdam, doi:10.1016/B978-044482830-9/50017-5.
  16. Bruno Blanchet (2016): Modeling and Verifying Security Protocols with the Applied Pi Calculus and ProVerif. Foundations and Trends in Privacy and Security 1(1-2), pp. 1–135, doi:10.1561/3300000004.
  17. Olivier Bodini (2021). Personal communication.
  18. Mirna Bognar (2002): Contexts in Lambda Calculus. Vrije Universiteit Amsterdam. Available at https://www.cs.vu.nl/en/Images/bognar_thesis_tcm210- 92584.pdf.
  19. Mirna Bognar & Roel C. de Vrijer (2001): A Calculus of Lambda Calculus Contexts. J. Autom. Reasoning 27(1), pp. 29–59, doi:10.1023/A:1010654904735.
  20. Michele Boreale & Rocco De Nicola (1995): Testing Equivalence for Mobile Processes. Inf. Comput. 120(2), pp. 279–303, doi:10.1006/inco.1995.1114.
  21. Flavien Breuvart (2015): Dissecting denotational semantics. Université Paris Diderot Paris VII. Available at https://www.lipn.univ-paris13.fr/~breuvart/ These_breuvart.pdf.
  22. Antonio Bucciarelli, Alberto Carraro, Thomas Ehrhard & Giulio Manzonetto (2011): Full Abstraction for Resource Calculus with Tests. In: Marc Bezem: CSL, LIPIcs 12. Schloss Dagstuhl, Dagstuhl, Germany, pp. 97–111, doi:10.4230/LIPIcs.CSL.2011.97.
  23. Luís Caires, Frank Pfenning & Bernardo Toninho (2016): Linear logic propositions as session types. MSCS 26(3), pp. 367–423, doi:10.1017/S0960129514000218.
  24. Vincent Danos & Jean Krivine (2004): Reversible Communicating Systems. In: Philippa Gardner & Nobuko Yoshida: CONCUR, LNCS 3170. Springer, pp. 292–307, doi:10.1007/978-3-540-28644-8_19.
  25. Rocco De Nicola & Matthew Hennessy (1984): Testing Equivalences for Processes. Theor. Comput. Sci. 34, pp. 83–133, doi:10.1016/0304-3975(84)90113-0.
  26. Rocco De Nicola, Ugo Montanari & Frits W. Vaandrager (1990): Back and Forth Bisimulations. In: Jos C. M. Baeten & Jan Willem Klop: CONCUR '90, LNCS 458. Springer, pp. 152–165, doi:10.1007/BFb0039058.
  27. Edsger W. Dijkstra (1968): Letters to the editor: go to statement considered harmful. Commun. ACM 11(3), pp. 147–148, doi:10.1145/362929.362947.
  28. Uffe Engberg & Mogens Nielsen (2000): A calculus of communicating systems with label passing - ten years after. In: Gordon D. Plotkin, Colin Stirling & Mads Tofte: Proof, Language, and Interaction, Essays in Honour of Robin Milner. The MIT Press, pp. 599–622.
  29. Claudia Faggian & Simona Ronchi Della Rocca (2019): Lambda Calculus and Probabilistic Computation. In: LICS. IEEE, pp. 1–13, doi:10.1109/LICS.2019.8785699.
  30. Cédric Fournet & Georges Gonthier (2005): A hierarchy of equivalences for asynchronous calculi. J. Log. Algebr. Methods Program. 63(1), pp. 131–173, doi:10.1016/j.jlap.2004.01.006.
  31. Simon Fowler, Sam Lindley & Philip Wadler (2017): Mixing Metaphors: Actors as Channels and Channels as Actors. In: Peter Müller: ECOOP 2017, LIPIcs 74. Schloss Dagstuhl, pp. 11:1–11:28, doi:10.4230/LIPIcs.ECOOP.2017.11.
  32. Yuxi Fu & Zhenrong Yang (2003): Tau laws for pi calculus. Theor. Comput. Sci. 308(1-3), pp. 55–130, doi:10.1016/S0304-3975(03)00202-0.
  33. Robert J. van Glabbeek (1993): The Linear Time - Branching Time Spectrum II. In: Eike Best: CONCUR '93, LNCS 715. Springer, pp. 66–81, doi:10.1007/3-540-57208-2_6.
  34. Andrew D. Gordon & Luca Cardelli (2003): Equational Properties Of Mobile Ambients. MSCS 13(3), pp. 371–408, doi:10.1017/S0960129502003742.
  35. Masatomo Hashimoto & Atsushi Ohori (2001): A typed context calculus. Theor. Comput. Sci. 266(1-2), pp. 249–272, doi:10.1016/S0304-3975(00)00174-2.
  36. Matthew Hennessy (2007): A distributed Pi-calculus. CUP, doi:10.1017/CBO9780511611063.
  37. Bas van den Heuvel & Jorge A. Pérez (2020): Session Type Systems based on Linear Logic: Classical versus Intuitionistic. In: Stephanie Balzer & Luca Padovani: PLACES@ETAPS 2020, EPTCS 314, pp. 1–11, doi:10.4204/EPTCS.314.1.
  38. Carl Hewitt, Peter Boehler Bishop, Irene Greif, Brian Cantwell Smith, Todd Matson & Richard Steiger (1973): Actor Induction and Meta-Evaluation. In: Patrick C. Fischer & Jeffrey D. Ullman: POPL. ACM Press, pp. 153–168, doi:10.1145/512927.512942.
  39. Daniel Hirschkoff, Enguerrand Prebet & Davide Sangiorgi (2020): On the Representation of References in the Pi-Calculus. In: Igor Konnov & Laura Kovács: CONCUR, LIPIcs 2017. Schloss Dagstuhl, pp. 34:1–34:20, doi:10.4230/LIPIcs.CONCUR.2020.34.
  40. Kohei Honda & Nobuko Yoshida (1995): On Reduction-Based Process Semantics. Theor. Comput. Sci. 151(2), pp. 437–486, doi:10.1016/0304-3975(95)00074-7.
  41. Eiichi Horita & Ken Mano (1997): A Metric Semantics for the π-Calculus Extended with External Events. Kôkyûroku 996, pp. 67–81. Available at http://hdl.handle.net/2433/61239.
  42. Ross Horne, Ki Yung Ahn, Shang-Wei Lin & Alwen Tiu (2018): Quasi-Open Bisimilarity with Mismatch is Intuitionistic. In: Anuj Dawar & Erich Grädel: LICS. ACM, pp. 26–35, doi:10.1145/3209108.3209125.
  43. Atsushi Igarashi, Benjamin C. Pierce & Philip Wadler (2001): Featherweight Java: A Minimal Core Calculus for Java and GJ. ACM Trans. Program. Lang. Syst. 23(3), pp. 396450, doi:10.1145/503502.503505.
  44. Jim Laird (2005): A Game Semantics of the Asynchronous π-Calculus. In: Martín Abadi & Luca de Alfaro: CONCUR, LNCS 3653. Springer, pp. 51–65, doi:10.1007/11539452_8.
  45. Ivan Lanese, Michael Lienhardt, Claudio Antares Mezzina, Alan Schmitt & Jean-Bernard Stefani (2013): Concurrent Flexible Reversibility. In: Matthias Felleisen & Philippa Gardner: ESOP, LNCS 7792. Springer, pp. 370–390, doi:10.1007/978-3-642-37036-6_21.
  46. Ivan Lanese, Doriana Medi\'c & Claudio Antares Mezzina (2019): Static versus dynamic reversibility in CCS. Acta Inform., doi:10.1007/s00236-019-00346-6.
  47. Ivan Lanese & Iain Phillips (2021): Forward-Reverse Observational Equivalences in CCSK. In: Shigeru Yamashita & Tetsuo Yokoyama: Reversible Computation - 13th International Conference, RC 2021, Virtual Event, July 7-8, 2021, Proceedings, LNCS 12805. Springer, pp. 126–143, doi:10.1007/978-3-030-79837-6_8.
  48. Ivan Lanese, Cátia Vaz & Carla Ferreira (2010): On the Expressive Power of Primitives for Compensation Handling. In: Andrew D. Gordon: ESOP, LNCS 6012. Springer, pp. 366–386, doi:10.1007/978-3-642-11957-6_20.
  49. Kim Guldstrand Larsen & Arne Skou (1991): Bisimulation through Probabilistic Testing. Inf. Comput. 94(1), pp. 1–28, doi:10.1016/0890-5401(91)90030-6.
  50. Jean-Marie Madiot (2015): Higher-order languages: dualities and bisimulation enhancements. École Normale Supérieure de Lyon, Università di Bologna. Available at https://hal.archives-ouvertes.fr/tel-01141067.
  51. Massimo Merro (1998): On the Expressiveness of Chi, Update, and Fusion calculi. In: Ilaria Castellani & Catuscia Palamidessi: EXPRESS, Electron. Notes Theor. Comput. Sci. 16. Elsevier, pp. 133–144, doi:10.1016/S1571-0661(04)00122-7.
  52. Massimo Merro & Francesco Zappa Nardelli (2005): Behavioral theory for mobile ambients. J. ACM 52(6), pp. 961–1023, doi:10.1145/1101821.1101825.
  53. Robin Milner (1977): Fully abstract models of typed λ-calculi. Theor. Comput. Sci. 4(1), pp. 1–22, doi:10.1016/0304-3975(77)90053-6.
  54. Robin Milner (1980): A Calculus of Communicating Systems. LNCS. Springer-Verlag, doi:10.1007/3-540-10235-3.
  55. Robin Milner (1981): A Modal Characterisation of Observable Machine-Behaviour. In: Egidio Astesiano & Corrado Böhm: CAAP '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings, LNCS 112. Springer, pp. 25–34, doi:10.1007/3-540-10828-9_52.
  56. Robin Milner (1986): A Calculus of Communicating Systems. LFCS Report Series ECS-LFCS-86-7. The University of Edinburgh. Available at http://www.lfcs.inf.ed.ac.uk/reports/86/ECS-LFCS-86-7/.
  57. Robin Milner (1989): Communication and Concurrency. PHI Series in computer science. Prentice-Hall.
  58. Robin Milner (1993): Elements of Interaction: Turing Award Lecture. Commun. ACM 36(1), pp. 7889, doi:10.1145/151233.151240.
  59. Robin Milner, Joachim Parrow & David Walker (1992): A Calculus of Mobile Processes, I. Inf. Comput. 100(1), pp. 1–40, doi:10.1016/0890-5401(92)90008-4.
  60. Robin Milner, Joachim Parrow & David Walker (1992): A Calculus of Mobile Processes, II. Inf. Comput. 100(1), pp. 41–77, doi:10.1016/0890-5401(92)90009-5.
  61. Robin Milner & Davide Sangiorgi (1992): Barbed Bisimulation. In: Werner Kuich: ICALP, LNCS 623. Springer, pp. 685–695, doi:10.1007/3-540-55719-9_114.
  62. Ugo Montanari & Vladimiro Sassone (1992): Dynamic congruence vs. progressing bisimulation for CCS. Fund. Inform. 16(1), pp. 171–199, doi:10.3233/FI-1992-16206.
  63. Aleksandar Nanevski, Frank Pfenning & Brigitte Pientka (2008): Contextual Modal Type Theory. ACM Trans. Comput. Log. 9(3), doi:10.1145/1352582.1352591.
  64. Mogens Nielsen & Christian Clausen (1994): Bisimulation for Models in Concurrency. In: Bengt Jonsson & Joachim Parrow: CONCUR '94, LNCS 836. Springer, pp. 385–400, doi:10.1007/BFb0015021.
  65. Mogens Nielsen, Uffe Engberg & Kim S. Larsen (1989): Fully abstract models for a process language with refinement. In: J. W. de Bakker, Willem P. de Roever & Grzegorz Rozenberg: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, Noordwijkerhout, The Netherlands, May 30 - June 3, 1988, Proceedings, LNCS 354. Springer, pp. 523–548, doi:10.1007/BFb0013034.
  66. Patrick Niemeyer & Daniel Leuck (2013): Learning Java, 4th edition. O'Reilly Media, Incorporated.
  67. Catuscia Palamidessi & Frank D. Valencia (2005): Recursion vs Replication in Process Calculi: Expressiveness. Bull. EATCS 87, pp. 105–125. Available at http://eatcs.org/images/bulletin/beatcs87.pdf.
  68. Joachim Parrow (2001): An Introduction to the π-Calculus. In: Jan A. Bergstra, Alban Ponse & Scott A. Smolka: Handbook of Process Algebra. North-Holland / Elsevier, pp. 479–543, doi:10.1016/b978-044482830-9/50026-6.
  69. Joachim Parrow & Davide Sangiorgi (1993): Algebraic Theories for Name-Passing Calculi. In: J. W. de Bakker, Willem P. de Roever & Grzegorz Rozenberg: A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium, Noordwijkerhout, The Netherlands, June 1-4, 1993, Proceedings, LNCS 803. Springer, pp. 509–529, doi:10.1007/3-540-58043-3_27.
  70. Iain Phillips & Irek Ulidowski (2006): Reversing Algebraic Process Calculi. In: Luca Aceto & Anna Ingólfsdóttir: FoSSaCS, LNCS 3921. Springer, pp. 246–260, doi:10.1007/11690634_17.
  71. Iain Phillips & Irek Ulidowski (2007): Reversibility and Models for Concurrency. Electron. Notes Theor. Comput. Sci. 192(1), pp. 93–108, doi:10.1016/j.entcs.2007.08.018.
  72. Benjamin C. Pierce & Davide Sangiorgi (1996): Typing and Subtyping for Mobile Processes. MSCS 6(5), pp. 409–453, doi:10.1017/S096012950007002X.
  73. Davide Sangiorgi (1996): A Theory of Bisimulation for the pi-Calculus. Acta Inform. 33(1), pp. 69–97, doi:10.1007/s002360050036.
  74. Davide Sangiorgi (1999): The Name Discipline of Uniform Receptiveness. Theor. Comput. Sci. 221(1-2), pp. 457–493, doi:10.1016/S0304-3975(99)00040-7.
  75. Davide Sangiorgi (2011): Introduction to Bisimulation and Coinduction. CUP, doi:10.1017/CBO9780511777110.
  76. Davide Sangiorgi (2011): Pi-Calculus. In: David A. Padua: Encyclopedia of Parallel Computing. Springer, pp. 1554–1562, doi:10.1007/978-0-387-09766-4_202.
  77. Davide Sangiorgi & Jan Rutten (2011): Advanced Topics in Bisimulation and Coinduction. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, doi:10.1017/CBO9780511792588.
  78. Davide Sangiorgi & David Walker (2001): On Barbed Equivalences in pi-Calculus. In: Kim Guldstrand Larsen & Mogens Nielsen: CONCUR, LNCS 2154. Springer, pp. 292–304, doi:10.1007/3-540-44685-0_20.
  79. Davide Sangiorgi & David Walker (2001): The Pi-calculus. CUP.
  80. Vladimiro Sassone, Mogens Nielsen & Glynn Winskel (1996): Models for Concurrency: Towards a Classification. Theor. Comput. Sci. 170(1-2), pp. 297–348, doi:10.1016/S0304-3975(96)80710-9.
  81. Peter Selinger & Benoît Valiron (2009): Quantum Lambda Calculus. In: Simon Gay & Ian Mackie: Semantic Techniques in Quantum Computation. Cambridge University Press, pp. 135172, doi:10.1017/CBO9781139193313.005.
  82. Colin Stirling (1995): Modal and Temporal Logics for Processes. In: Faron Moller & Graham M. Birtwistle: Logics for Concurrency - Structure versus Automata (8th Banff Higher Order Workshop, Banff, Canada, August 27 - September 3, 1995, Proceedings), LNCS 1043. Springer, pp. 149–237, doi:10.1007/3-540-60915-6_5.
  83. Paul Taylor: Comment to "Substitution is pullback". Available at http://math.andrej.com/2012/09/28/substitution-is-pullback/.
  84. André van Tondervan (2004): A Lambda Calculus for Quantum Computation. SIAM J. Comput. 33(5), pp. 1109–1135, doi:10.1137/S0097539703432165.
  85. Carlos A. Varela (2013): Programming Distributed Computing Systems: A Foundational Approach. The MIT Press.
  86. Glynn Winskel (2017): Event Structures, Stable Families and Concurrent Games. Lecture notes. University of Cambridge. Available at https://www.cl.cam.ac.uk/~gw104/ecsym-notes.pdf.
  87. Wang Yi (1991): CCS + Time = An Interleaving Model for Real Time Systems. In: Javier Leach Albert, Burkhard Monien & Mario Rodríguez-Artalejo: ICALP, LNCS 510. Springer, pp. 217–228, doi:10.1007/3-540-54233-7_136.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org