💾 Archived View for dcreager.net › papers › Lafont1997.gmi captured on 2024-12-17 at 09:34:01. Gemini links have been rewritten to link to archived content
-=-=-=-=-=-=-
Yves Lafont, “Interaction Combinators”. In Information and Computation, Volume 137, Issue 1, 1997, Pages 69-101.
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.
@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}
}