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 nets forlinear logic, but no preliminary knowledge of these topics is required for its reading.

[1]  Martín Abadi,et al.  Linear logic without boxes , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[2]  Simon J. Gay.  Combinators for Interaction Nets , 1994, Theory and Formal Methods.

[3]  Alan Bawden,et al.  Connection graphs , 1986, LFP '86.

[4]  Jean-Yves Girard,et al.  Geometry of Interaction 1: Interpretation of System F , 1989 .

[5]  Jean-Yves Girard,et al.  Linear logic: its syntax and semantics , 1995 .

[6]  Yves Lafont,et al.  Interaction nets , 1989, POPL '90.

[7]  Vincent Danos,et al.  Proof-nets and the Hilbert space , 1995 .

[8]  Y. Lafont.  From proof-nets to interaction nets , 1995 .

[9]  Martín Abadi,et al.  The geometry of optimal lambda reduction , 1992, POPL '92.

[10]  John Lamping.  An algorithm for optimal lambda calculus reduction , 1989, POPL '90.