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…
Be the first to leave a comment!