References

[84] Introduction to Lambda Calculus. 1984. [1]
[AI99] Luca Aceto, Anna Ingólfsdóttir. Testing Hennessy-Milner Logic with Recursion. In Wolfgang Thomas, editor, Foundations of Software Science and Computation Structure, Second International Conference, FoSSaCS'99, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99, Amsterdam, The Netherlands, March 22-28, 1999, Proceedings, volume 1578 of Lecture Notes in Computer Science, 41–55. Springer, 1999. doi:10.1007/3-540-49019-1\_4, URL: https://doi.org/10.1007/3-540-49019-1\_4. [1] [2]
[BN98] Franz Baader, Tobias Nipkow. Term rewriting and all that. Cambridge University Press, USA, 1998. ISBN 0521455200. [1]
[Cha12] Arthur Charguéraud. The Locally Nameless Representation. Journal of Automated Reasoning, 49(3):363–408, Oct 2012. doi:10.1007/s10817-011-9225-2, URL: https://doi.org/10.1007/s10817-011-9225-2. [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11]
[Cut80] Nigel J. Cutland. Computability: An Introduction to Recursive Function Theory. Cambridge University Press, Cambridge, 1980. ISBN 978-0-521-29465-2. [1]
[Dan08] Nils Anders Danielsson. Lightweight semiformal time complexity analysis for purely functional data structures. In Proceedings of the 35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '08, 133–144. New York, NY, USA, 2008. Association for Computing Machinery. doi:10.1145/1328438.1328457, URL: https://doi.org/10.1145/1328438.1328457. [1]
[Gir95] J.-Y. Girard. Linear Logic: its syntax and semantics, pages 1–42. London Mathematical Society Lecture Note Series. Cambridge University Press, 1995. [1] [2]
[Gir87] Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50(1):1–101, 1987. doi:10.1016/0304-3975(87)90045-4, URL: https://www.sciencedirect.com/science/article/pii/0304397587900454. [1]
[HM85] Matthew Hennessy, Robin Milner. Algebraic Laws for Nondeterminism and Concurrency. J. ACM, 32(1):137–161, 1985. doi:10.1145/2455.2460, URL: https://doi.org/10.1145/2455.2460. [1] [2]
[HMU06] John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman. Introduction to Automata Theory, Languages, and Computation (3rd Edition). Addison-Wesley Longman Publishing Co., Inc., USA, 2006. ISBN 0321455363. [1] [2] [3] [4]
[KI15] Oleg Kiselyov, Hiromi Ishii. Freer Monads, More Extensible Effects. In Proceedings of the 2015 ACM SIGPLAN Symposium on Haskell, Haskell 2015, 94–105. New York, NY, USA, 2015. ACM. doi:10.1145/2804302.2804319, URL: https://doi.org/10.1145/2804302.2804319. [1]
[Mil18] Bartosz Milewski. The Dao of Functional Programming. Self-published, 2018. Available online at https://bartoszmilewski.com. [1]
[Mil80] Robin Milner. A Calculus of Communicating Systems. Volume 92 of Lecture Notes in Computer Science. Springer, 1980. ISBN 3-540-10235-3. doi:10.1007/3-540-10235-3, URL: https://doi.org/10.1007/3-540-10235-3. [1] [2]
[Mon23] Fabrizio Montesi. Introduction to Choreographies. Cambridge University Press, Cambridge, 2023. ISBN 978-1-108-83376-9. doi:10.1017/9781108981491, URL: https://www.cambridge.org/core/books/introduction-to-choreographies/65D3DA3CFF11AB835452CBC97FAE4830. [1] [2] [3]
[San] Davide Sangiorgi. Introduction to Bisimulation and Coinduction. Cambridge University Press. ISBN 978-1-107-00363-7. doi:10.1017/CBO9780511777110, URL: https://www.cambridge.org/core/books/introduction-to-bisimulation-and-coinduction/8B54001CB763BAE9C4BA602C0A341D60. [1] [2] [3] [4] [5] [6] [7] [8] [9]
[SS63] J. C. Shepherdson, H. E. Sturgis. Computability of Recursive Functions. Journal of the ACM, 10(2):217–255, 1963. doi:10.1145/321160.321170. [1]
[Tho90] Wolfgang Thomas. Automata on Infinite Objects. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, pages 133–191. Elsevier and MIT Press, 1990. [1] [2]