Abstract
In the framework of interaction nets [6], Yves Lafont has proved [8] that every interaction system can be simulated by a system composed of 3 symbols named γ, δ and ε. One may wonder if it is possible to find a similar universal system with less symbols. In this paper, we show a way to simulate every interaction system with a specific interaction system constituted of only 2 symbols. By transitivity, we prove that we can find a universal interaction system with only 2 agents. Moreover, we show how to find such a system where agents have no more than 3 auxiliary ports.
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
D. Bechet. Proof transformations in linear logic. In Colloquium PREUVES, RÉSEAUX ET TYPES. CIRM, Marseille, France, 1994.
S. Gay. Combinators for interaction nets. In I. C. Mackie & R. Nagarajan C. L. Hankin, editor, Proceedings of the Second Imperial College Department of Computing Workshop on Theory and Formal Methods. Imperial College Press, 1995.
J.-Y. Girard. Linear logic. Theoretical Computer Science, 50:1–102, 1987.
G. Gonthier, M. Abadi, and J.-J. Levy. The geometry of optimal lambda reduction. In Proceedings of the Nineteenth Annual Symposium on Principles of Programming Languages (POPL’ 90), pages 15–26, Albuquerque, New Mexico, January 1992. ACM Press.
G. Gonthier, M. Abadi, and J.-J. Levy. Linear logic without boxes. In Seventh Annual Symposium on Logic in Computer Science, pages 223–234, Santa Cruz, California, June 1992. IEEE Computer Society Press.
Y. Lafont. Interaction nets. In Seventeenth Annual Symposium on Principles of Programming Languages, pages 95–108, San Francisco, California, 1990. ACM Press.
Y. Lafont. From proof nets to interaction nets. In J.-Y. Girard, Y. Lafont, and L. Regnier, editors, Advances in Linear Logic, pages 225–247. Cambridge University Press, 1995. Proceedings of the Workshop on Linear Logic, Ithaca, New York, June 1993.
Y. Lafont. Interaction combinators. Information and Computation, 137(1):69–101, 1997.
J. Lamping. An algorithm for optimal lambda calculus reduction. In Seventeenth Annual Symposium on Principles of Programming Languages (POPL’ 90), pages 16–46, San Francisco, California, 1990. ACM Press.
I. Mackie. The Geometry of Implementation (an investigation into using the Geometry of Interaction for language implementation). PhD thesis, Departement of Computing, Imperial College of Science, Technology and Medecine, 1994.
I. Mackie. Interaction nets for linear logic. Theoretical Computer Science, 247:83–140, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bechet, D. (2001). Universal Interaction Systems with Only Two Agents. In: Middeldorp, A. (eds) Rewriting Techniques and Applications. RTA 2001. Lecture Notes in Computer Science, vol 2051. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45127-7_3
Download citation
DOI: https://doi.org/10.1007/3-540-45127-7_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42117-7
Online ISBN: 978-3-540-45127-3
eBook Packages: Springer Book Archive