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...
Saved in:
Published in | Information and computation Vol. 137; no. 1; pp. 69 - 101 |
---|---|
Main Author | |
Format | Journal Article |
Language | English |
Published |
San Diego, CA
Elsevier Inc
25.08.1997
Elsevier |
Subjects | |
Online Access | Get full text |
Cover
Loading…
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 |