Learn More
We propose a new kind of programming language, with the following features: <list><item>a simple graph rewriting semantics, </item><item>a complete symmetry between constructors and destructors, </item><item>a type discipline for deterministic and deadlock-free (microscopic) parallelism. </item></list><italic>Interaction nets</italic> generalize Girard's(More)
It is shown that a very simple system of interaction com-binators, with only 3 symbols and 6 rules, is a universal model of distributed computation, in a sense that will be made precise. This paper is the continuation of the au-thor's work on interaction nets, inspired by Girard's proof nets for linear logic, but no preliminary knowledge of these topics is(More)