Universal Interaction Systems with Only Two Agents

Authors:
Denis Bechet
Affiliations:
-
Venue:
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Year:
2001

Citing 7
Cited 0

Linear logic

Theoretical Computer Science
An algorithm for optimal lambda calculus reduction

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Interaction nets

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The geometry of optimal lambda reduction

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From proof-nets to interaction nets

Proceedings of the workshop on Advances in linear logic
Interaction combinators

Information and Computation
Interaction nets for linear logic

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.