Abstract
The symmetric interaction combinators are a variant of Lafont’s interaction combinators. They are a graph-rewriting model of parallel deterministic computation. We define a notion analogous to that of head normal form in the λ-calculus, and make a semantical study of the corresponding observational equivalence. We associate with each net a compact metric space, called edifice, and prove that two nets are observationally equivalent iff they have the same edifice. Edifices may therefore be compared to Böhm trees in infinite η-normal form, or to Nakajima trees, and give a precise topological account of phenomena like infinite η-expansion.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lafont, Y.: Interaction nets. In: Conference Record of POPL’90, pp. 95–108. ACM Press, New York (1990)
Girard, J.Y.: Proof-nets: The parallel syntax for proof-theory. In: Ursini, A. (ed.) Logic and Algebra, Marcel Dekker (1996)
Lafont, Y.: From proof nets to interaction nets. In: Girard, J.Y., Lafont, Y., Regnier, L. (eds.) Advances in Linear Logic, pp. 225–247. Cambridge University Press, Cambridge (1995)
Gonthier, G., Abadi, M., Lévy, J.J.: The geometry of optimal lambda reduction. In: Conference Record of POPL 92, pp. 15–26. ACM Press, New York (1992)
Mackie, I.: Efficient lambda evaluation with interaction nets. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 155–169. Springer, Heidelberg (2004)
Mackie, I.: An interaction net implementation of additive and multiplicative structures. Journal of Logic and Computation 15(2), 219–237 (2005)
Lafont, Y.: Interaction combinators. Information and Computation 137(1), 69–101 (1997)
Fernández, M., Mackie, I.: Operational equivalence for interaction nets. Theoretical Computer Science 297(1-3), 157–181 (2003)
Mazza, D.: A denotational semantics for the symmetric interaction combinators. Mathematical Structures in Computer Science, 17(3) (to appear, 2007)
Wadsworth, C.: The relation between computational and denotational properties for Scott’s D ∞ models. Siam J. Comput. 5(3), 488–521 (1976)
Hyland, M.: A syntactic characterization of the equality in some models of the lambda calculus. J. London Math. Society 2(12), 361–370 (1976)
Nakajima, R.: Infinite normal forms for the λ-calculus. In: Böhm, C. (ed.) Lambda-Calculus and Computer Science Theory. LNCS, pp. 62–82. Springer, Heidelberg (1975)
Danos, V., Regnier, L.: Proof nets and the Hilbert space. In: Girard, J.Y., Lafont, Y., Regnier, L. (eds.) Advances in Linear Logic, pp. 307–328. Cambridge University Press, Cambridge (1995)
Mackie, I., Pinto, J.S.: Encoding linear logic with interaction combinators. Information and Computation 176(2), 153–186 (2002)
Mazza, D.: Observational equivalence for the interaction combinators and internal separation. In: Mackie, I. (ed.) Proceedings of TERMGRAPH 2006. ENTCS, pp. 7–16. Elsevier, Amsterdam (2006)
Kennaway, R., Klop, J.W., Sleep, R., de Vries, F.J.: Infinitary lambda calculus. Theoretical Computer Science 175(1), 93–125 (1997)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Mazza, D. (2007). Edifices and Full Abstraction for the Symmetric Interaction Combinators. In: Della Rocca, S.R. (eds) Typed Lambda Calculi and Applications. TLCA 2007. Lecture Notes in Computer Science, vol 4583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73228-0_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-73228-0_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73227-3
Online ISBN: 978-3-540-73228-0
eBook Packages: Computer ScienceComputer Science (R0)