Reading:
- Barendregt & Barendsen (2000)
- Wadler (1993)
- Baader & Nipkow (1999)
- Lafont (1990)
- Lafont (1995)
- Lafont (1997)
Notes
References
Baader, F., & Nipkow, T. (1999). Term Rewriting and All That (1st paperback edition). Cambridge University Press.
Barendregt, H., & Barendsen, E. (2000). Introduction to Lambda Calculus.
Lafont, Y. (1990). Interaction Nets. Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL ’90, 95–108. https://doi.org/10.1145/96709.96718
Lafont, Y. (1995). From Proof Nets to Interaction Nets. Advances in Linear Logic, 225–248. https://doi.org/10.1017/CBO9780511629150.012
Lafont, Y. (1997). Interaction Combinators. Information and Computation, 137(1), 69–101. https://doi.org/10.1006/inco.1997.2643
Wadler, P. (1993). A Taste of Linear Logic. In G. Goos, J. Hartmanis, A. M. Borzyszkowski, & S. Sokołowski (Eds.), Mathematical Foundations of Computer Science 1993 (Vol. 711, pp. 185–210). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-57182-5_12