Interaction Combinators

Interaction Combinators
复制标题

交互组合器

DOI:
10.1006/inco.1997.2643
复制
发表时间:
1997
期刊:
Inf. Comput.
影响因子:
--
通讯作者:
Y. Lafont
Y. Lafont
中科院分区:
--
文献类型:
--
作者:
Y. Lafont

文献摘要

被引文献

相似文献

结果表明,只有三个符号和六个规则的非常简单的Interaction Comminators系统是分布式计算的通用模型,从某种意义上说,这将是精确的。本文是作者在互动网中的延续,灵感来自Girard的证明网络效果,但是对这些主题的阅读不需要初步知识。
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.