Interaction Combinators

Information and Computation

Volumn 137, Issue 1, 1997, Pages 69-101

  Lafont, Yves ^a  

^a AIX MARSEILLE UNIVERSITÉ   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001936016     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1997.2643     Document Type: Article

References (11)

1. Bawden, A. (1986), Connection graphs, in "Proceedings of ACM Conference on Lisp and Functional Programming," pp. 258-265.
2. Danos, V., and Regnier, L. (1995), Proof-nets and the Hilbert space, in "Advances in Linear Logic" (J.-Y. Girard, Y. Lafont, and L. Regnier, Eds.), London Mathematical Society Lecture Note Series, Vol. 222, pp. 307-328, Cambridge Univ. Press, Cambridge, UK.
3. Gay, S. J. (1995), Combinators for interaction nets, in "Proceedings of the Second Imperial College Department of Computing Workshop on Theory and Formal Methods" (C. L. Hankin, I. C. Mackie, and R. Nagarajan, Eds.), Imperial College Press.
4. Girard, J.-Y. (1989), Geometry of interaction I: Interpretation of system F, in "Proceedings, Logic Colloquium '88" (Ferro et al., Eds.), pp. 221-260, North-Holland, Amsterdam.
5. Girard, J.-Y. (1995), Linear logic: Its syntax and semantics, in "Advances in Linear Logic" (J.-Y. Girard, Y. Lafont, and L. Regnier, Eds.), London Mathematical Society Lecture Note Series, Vol. 222, pp. 1-42, Cambridge Univ. Press, Cambridge, UK.
6. Gonthier, G., Abadi, M., and Levy, J.-J. (1992), The geometry of optimal lambda reduction, in "Proceedings of 19th ACM Symposium on Principles of Programming Languages (POPL '92)," Assoc. Comput. Mach., New York.
7. Gonthier, G., Abadi, M., and Levy, J.-J. (1992), Linear logic without boxes, in "Proceedings of 7th Annual Symposium on Logic in Computer Science (LICS '92)," IEEE Press, New York.
8. Lafont, Y. (1990), Interaction nets, in "Proceedings of 17th ACM Symposium on Principles of Programming Languages (POPL '90)," pp. 95-108, Assoc. Comput. Mach., New York.
9. Lafont, Y. (1995), From proof-nets to interaction nets, in "Advances in Linear Logic" (J.-Y. Girard, Y. Lafont, and L. Regnier, Eds.), London Mathematical Society Lecture Note Series, Vol. 222, pp. 225-247, Cambridge Univ. Press, Cambridge, UK.
10. Lamping, J. (1990), An algorithm for optimal lambda calculus reduction, in "Proceedings of 17th ACM Symposium on Principles of Programming Languages (POPL '90)," pp. 16-46, Assoc. Comput. Mach., New York.
11. Mackie, I., (1994) "The Geometry of Implementation (An Investigation into Using the Geometry of Interaction for Language Implementation)," Ph.D. thesis, Imperial College of Science, Technology, and Medicine, London.