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. Available at https://doi.org/10.1145/3127586.
  2. Martín Abadi & Cédric Fournet (2001): Mobile Values, New Names, and Secure Communication. In: Proceedings of the 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. Association for Computing Machinery, New York, NY, USA, pp. 104–115. Available at https://doi.org/10.1145/360204.360213.
  3. Roberto M. Amadio, Lone Leth Thomsen & Bent Thomsen (1995): From a Concurrent Lambda-Calculus to the Pi-Calculus. In: Horst Reichel: Fundamentals of Computation Theory, 10th International Symposium, FCT '95, Dresden, Germany, August 22-25, 1995, Proceedings, Lecture Notes in Computer Science 965. Springer, pp. 106–115. Available at https://doi.org/10.1007/3-540-60249-6_43.
  4. Patrick Baillot & Alexis Ghyselen (2022): Types for Complexity of Parallel Computation in Pi-calculus 44. Association for Computing Machinery, New York, NY, USA. Available at https://doi.org/10.1145/3495529.
  5. Jesper Bengtson, Magnus Johansson, Joachim Parrow & Björn Victor (2009): Psi-calculi: Mobile Processes, Nominal Data, and Logic. In: Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, LICS 2009, 11-14 August 2009, Los Angeles, CA, USA. IEEE Computer Society, pp. 39–48. Available at https://doi.org/10.1109/LICS.2009.20.
  6. Marco Carbone & Sergio Maffeis (2002): On the Expressive Power of Polyadic Synchronisation in pi-calculus. In: Uwe Nestmann & Prakash Panangaden: 9th International Workshop on Expressiveness in Concurrency, EXPRESS 2002, Satellite Workshop from CONCUR 2002, Brno, Czech Republic, August 19, 2002, Electronic Notes in Theoretical Computer Science 68. Elsevier, pp. 15–32. Available at https://doi.org/10.1016/S1571-0661(05)80361-5.
  7. Cristian Ene & Traian Muntean (1999): Expressiveness of Point-to-Point versus Broadcast Communications. In: Fundamentals of Computation Theory, 12th International Symposium, FCT '99, Iasi, Romania, August 30 - September 3, 1999, Proceedings, pp. 258–268. Available at https://doi.org/10.1007/3-540-48321-7_21.
  8. Futhark: A Parallel Cost Model for Futhark Programs. Available at https://futhark-book.readthedocs.io/en/latest/parallel-cost-model.html.
  9. Simon Gay & Malcolm Hole (2005): Subtyping for session types in the pi calculus. Acta Informatica 42(2), pp. 191–225. Available at https://doi.org/10.1007/s00236-005-0177-z.
  10. Troels Henriksen (2017): Design and Implementation of the Futhark Programming Language. Ph.D. thesis. DIKU. Available at https://di.ku.dk/english/research/phd/phd-theses/2017/Troels_Henriksen_thesis.pdf.
  11. Hans Hüttel & Nuno Pratas (2015): Broadcast and aggregation in BBC. In: Simon Gay & Jade Alglave: Proceedings Eighth International Workshop on Programming Language Approaches to Concurrency- and Communication-cEntric Software, PLACES 2015, London, UK, 18th April 2015, EPTCS 203, pp. 15–28. Available at https://doi.org/10.4204/EPTCS.203.2.
  12. Lars Jensen, Chris Oliver Paulsen & Julian Jørgensen Teule (2023): Translating Concepts of the Futhark Programming Language into an Extended pi-Calculus. Master's thesis. AAU. Available at https://futhark-lang.org/student-projects/pi-msc-thesis.pdf. Available at https://futhark-lang.org/student-projects/pi-msc-thesis.pdf.
  13. Robin Milner (1990): Functions as processes. In: Michael S. Paterson: Automata, Languages and Programming. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 167–180. Available at https://doi.org/10.1007/BFb0032030.
  14. Robin Milner (1993): The Polyadic π-Calculus: a Tutorial. In: Friedrich L. Bauer, Wilfried Brauer & Helmut Schwichtenberg: Logic and Algebra of Specification. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 203–246. Available at https://doi.org/10.1007/978-3-642-58041-3_6.
  15. Robin Milner (1999): Communicating and mobile systems - the π-calculus. Cambridge University Press.
  16. Davide Sangiorgi (1993): An Investigation into Functions as Processes. In: Stephen D. Brookes, Michael G. Main, Austin Melton, Michael W. Mislove & David A. Schmidt: Mathematical Foundations of Programming Semantics, 9th International Conference, New Orleans, LA, USA, April 7-10, 1993, Proceedings, Lecture Notes in Computer Science 802. Springer, pp. 143–159. Available at https://doi.org/10.1007/3-540-58027-1_7.
  17. Davide Sangiorgi (1994): The Lazy Lambda Calculus in a Concurrency Scenario. Inf. Comput. 111(1), pp. 120–153. Available at https://doi.org/10.1006/inco.1994.1042.
  18. Davide Sangiorgi (1999): From lambda to pi; or, Rediscovering continuations. Math. Struct. Comput. Sci. 9(4), pp. 367–401. Available at https://doi.org/10.1017/S0960129599002881.
  19. Davide Sangiorgi & David Walker (2001): The π-Calculus - a theory of mobile processes. Cambridge University Press.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org