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...

Full description

Saved in:
Bibliographic Details
Published inInformation and computation Vol. 137; no. 1; pp. 69 - 101
Main Author Lafont, Yves
Format Journal Article
LanguageEnglish
Published San Diego, CA Elsevier Inc 25.08.1997
Elsevier
Subjects
Online AccessGet full text

Cover

Loading…