¶Abstract

It is shown that a very simple system of interaction 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 on interaction nets, inspired by Girard's proof nets for linear logic, but no preliminary knowledge of these topics is required for its reading.

» Theory » Interaction nets

¶BiBTeX

@article{LAFONT199769,
title = {Interaction Combinators},
journal = {Information and Computation},
volume = {137},
number = {1},
pages = {69-101},
year = {1997},
issn = {0890-5401},
doi = {https://doi.org/10.1006/inco.1997.2643},
url = {https://www.sciencedirect.com/science/article/pii/S0890540197926432},
author = {Yves Lafont}
}