A Hierarchy of Expressiveness in Concurrent Interaction Nets

We give separation results, in terms of expressiveness, concerning all the concurrent extensions of interaction nets defined so far in the literature: we prove that multirule interaction nets (of which Ehrhard and Regnier's differential interaction nets are a special case) are strictly less expressive than multiwire interaction nets (which include Beffara and Maurel's concurrent nets and Honda and Laurent's version of polarized proof nets); these, in turn, are strictly less expressive than multiport interaction nets (independently introduced by Alexiev and the second author), although in a milder way. These results are achieved by providing a notion of barbed bisimilarity for interaction nets which is general enough to adapt to all systems but is still concrete enough to allow (hopefully) convincing separation results. This is itself a contribution of the paper.

[1]  Emmanuel Beffara,et al.  Concurrent Nets: A Study of Prefixing in Process Calculi , 2005, EXPRESS.

[2]  Nobuko Yoshida Graph Notation for Concurrent Combinators , 1994, Theory and Practice of Parallel Programming.

[3]  Cosimo Laneve,et al.  Solos In Concert , 2003, Math. Struct. Comput. Sci..

[4]  Damiano Mazza,et al.  Multiport Interaction Nets and Concurrency , 2005, CONCUR.

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

[6]  Vladimir Alexiev,et al.  Non-deterministic interaction nets , 1999 .

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

[8]  Daniele Gorla,et al.  Towards a unified approach to encodability and separation results for process calculi , 2008, Inf. Comput..

[9]  Yves Lafont Interaction Combinators , 1997, Inf. Comput..

[10]  Thomas Ehrhard,et al.  Differential Interaction Nets , 2005, WoLLIC.

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

[12]  Takayasu Ito,et al.  Theory and Practice of Parallel Programming , 1995, Lecture Notes in Computer Science.

[13]  Olivier Laurent,et al.  An exact correspondence between a typed pi-calculus and polarised proof-nets , 2010, Theor. Comput. Sci..

[14]  Ian Mackie Interaction Net Implementation of Additive and Multiplicative Structures , 2005, J. Log. Comput..

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

[16]  Ron Dinishak The optimal implementation of functional programming languages , 2000, SOEN.

[17]  Ian Mackie An Interaction Net Implementation of Closed Reduction , 2008, IFL.

[18]  Philippa Gardner,et al.  Explicit fusions , 2000, Theor. Comput. Sci..

[19]  Catuscia Palamidessi,et al.  Comparing the expressive power of the synchronous and asynchronous $pi$-calculi , 2003, Mathematical Structures in Computer Science.

[20]  Joachim Parrow,et al.  Expressiveness of Process Algebras , 2008, LIX.

[21]  Vincent Danos,et al.  Transactions in RCCS , 2005, CONCUR.

[22]  Thomas Ehrhard,et al.  Interpreting a finitary pi-calculus in differential interaction nets , 2007, Inf. Comput..