References

  1. Martín Abadi & Andrew D. Gordon (1999): A Calculus for Cryptographic Protocols: The Spi Calculus. Information and Computation 148(1), pp. 1–70, doi:10.1006/inco.1998.2740.
  2. Alexander R. Bendixen, Bjarke B. Bojesen, Hans Hüttel & Stian Lybech (2022): Typing Reflection in Higher-Order Psi-calculi. Technical Report. Department of Computer Science, Aalborg University. Available at http://icetcs.ru.is/stian/2022/hopsitypes2022techreport.pdf.
  3. Jesper Bengtson, Magnus Johansson, Joachim Parrow & Björn Victor (2009): Psi-calculi: Mobile processes, nominal data, and logic. In: 2009 24th Annual IEEE Symposium on Logic In Computer Science. IEEE, pp. 39–48, doi:10.1016/S1571-0661(05)80361-5.
  4. Jesper Bengtson, Magnus Johansson, Joachim Parrow & Björn Victor (2011): Psi-calculi: a framework for mobile processes with nominal data and logic. Logical Methods in Computer Science Volume 7, Issue 1, doi:10.2168/LMCS-7(1:11)2011. Available at https://lmcs.episciences.org/696.
  5. Luís Caires (2007): Logical Semantics of Types for Concurrency. In: Till Mossakowski, Ugo Montanari & Magne Haveraaen: Algebra and Coalgebra in Computer Science. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 16–35, doi:10.1006/inco.1994.1093.
  6. Marco Carbone & Sergio Maffeis (2003): On the Expressive Power of Polyadic Synchronisation in Pi-Calculus. Nordic Journal of Computing 10(2), pp. 70–98, doi:10.1016/S1571-0661(05)80361-5.
  7. Romain Demangeon, Daniel Hirschkoff & Davide Sangiorgi (2010): Termination in higher-order concurrent calculi. The Journal of Logic and Algebraic Programming 79(7), pp. 550–577, doi:10.1016/j.jlap.2010.07.007. The 20th Nordic Workshop on Programming Theory (NWPT 2008).
  8. Murdoch Gabbay & Andrew Pitts (2002): A New Approach to Abstract Syntax with Variable Binding. Formal Asp. Comput. 13, pp. 341–363, doi:10.1007/s001650200016.
  9. Philippa Gardner & Lucian Wischik (2000): Explicit fusions. In: International Symposium on Mathematical Foundations of Computer Science. Springer, pp. 373–382, doi:10.1007/3-540-44612-5_33.
  10. Daniele Gorla (2010): Towards a unified approach to encodability and separation results for process calculi. Information and Computation 208(9), pp. 1031–1053, doi:10.1016/j.ic.2010.05.002.
  11. Matthew Hennessy & James Riely (2002): Resource Access Control in Systems of Mobile Agents. Information and Computation 173(1), pp. 82–120, doi:10.1006/inco.2001.3089.
  12. Hans Hüttel (2011): Typed ψ-calculi. In: International Conference on Concurrency Theory. Springer, pp. 265–279, doi:10.1007/978-3-642-23217-6_18.
  13. Hans Hüttel (2014): Types for Resources in ψ-calculi. In: Martín Abadi & Alberto Lluch Lafuente: Trustworthy Global Computing. Springer International Publishing, Cham, pp. 83–102, doi:10.1007/978-3-319-05119-2_6.
  14. Hans Hüttel (2016): Binary Session Types for Psi-Calculi. In: Atsushi Igarashi: Programming Languages and Systems. Springer International Publishing, Cham, pp. 96–115, doi:10.1007/978-3-319-47958-3_6.
  15. Atsushi Igarashi & Naoki Kobayashi (2004): A generic type system for the Pi-calculus. Theoretical Computer Science 311(1), pp. 121–163, doi:10.1016/S0304-3975(03)00325-6.
  16. Barbara König (2005): Analysing input/output-capabilities of mobile processes with a generic type system. The Journal of Logic and Algebraic Programming 63(1), pp. 35–58, doi:10.1016/j.jlap.2004.01.004. Special issue on The pi-calculus.
  17. Stian Lybech (2022): Encodability and Separation for a Reflective and Higher-Order Language. this volume of EPTCS. Open Publishing Association.
  18. L.G. Meredith & Matthias Radestock (2005): A Reflective Higher-order Calculus. Electronic Notes in Theoretical Computer Science 141(5), pp. 49 – 67, doi:10.1016/j.entcs.2005.05.016. Proceedings of the Workshop on the Foundations of Interactive Computation (FInCo 2005).
  19. Robin Milner (1993): The Polyadic π-Calculus: a Tutorial. In: Logic and Algebra of Specification. Springer Berlin Heidelberg, pp. 203–246, doi:10.1007/978-3-642-58041-3_6.
  20. Joachim Parrow (2001): An introduction to the π-calculus. In: Handbook of Process Algebra. Elsevier, pp. 479–543, doi:10.1016/B978-044482830-9/50026-6.
  21. Joachim Parrow, Johannes Borgström, Palle Raabjerg & Johannes Åman Pohjola (2014): Higher-order psi-calculi. Mathematical Structures in Computer Science 24(2), doi:10.1017/S0960129513000170.
  22. Benjamin Pierce & Davide Sangiorgi (1993): Typing and subtyping for mobile processes. In: [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science. IEEE, pp. 376–385, doi:10.1109/LICS.1993.287570.
  23. Davide Sangiorgi (1993): Expressing mobility in process algebras: first-order and higher-order paradigms. University of Edinburgh. Available at http://hdl.handle.net/1842/6569.
  24. Davide Sangiorgi (1993): From π-calculus to higher-order π-calculus — and back. In: M. C. Gaudel & J. P. Jouannaud: TAPSOFT'93: Theory and Practice of Software Development. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 151–166, doi:10.1007/3-540-56610-4_62.
  25. Davide Sangiorgi & David Walker (2003): The pi-calculus: a Theory of Mobile Processes. Cambridge university press.
  26. Bent Thomsen (1989): A Calculus of Higher Order Communicating Systems. In: Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL' 89, POPL'89. ACM Press, New York, NY, USA, pp. 143–154, doi:10.1145/75277.75290.
  27. Bent Thomsen (1993): Plain CHOCS A Second Generation Calculus for Higher Order Processes. Acta Inf. 30(1), pp. 1–59, doi:10.1007/BF01200262.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org