Interaction Combinators

It is shown that a very simple system ofinteraction combinators, with only three symbols and six rules, is a universal model of distributed computation, in a sense that will be made precise. This paper is the continuation of the author's work oninteraction nets, inspired by Girard's proof...

Full description

Saved in:
Bibliographic Details
Published inInformation and computation Vol. 137; no. 1; pp. 69 - 101
Main Author Lafont, Yves
Format Journal Article
LanguageEnglish
Published San Diego, CA Elsevier Inc 25.08.1997
Elsevier
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Software
Theoretical computing
Combinatorial problem
Distributed computing
Distributed computer systems
Online AccessGet full text

Cover

More Information
Summary:It is shown that a very simple system ofinteraction combinators, with only three symbols and six rules, is a universal model of distributed computation, in a sense that will be made precise. This paper is the continuation of the author's work oninteraction nets, inspired by Girard's proof nets forlinear logic, but no preliminary knowledge of these topics is required for its reading.
ISSN:0890-5401
1090-2651
DOI:10.1006/inco.1997.2643