An algorithm for optimal lambda calculus reduction
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The geometry of optimal lambda reduction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From proof-nets to interaction nets
Proceedings of the workshop on Advances in linear logic
Information and Computation
The optimal implementation of functional programming languages
The optimal implementation of functional programming languages
Graph Notation for Concurrent Combinators
TPPP '94 Proceedings of the International Workshop on Theory and Practice of Parallel Programming
Operational equivalence for interaction nets
Theoretical Computer Science - Latin American theoretical informatics
Non-deterministic interaction nets
Non-deterministic interaction nets
Mathematical Structures in Computer Science
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi
Mathematical Structures in Computer Science
Interaction Net Implementation of Additive and Multiplicative Structures
Journal of Logic and Computation
Multiport interaction nets and concurrency
CONCUR 2005 - Concurrency Theory
Concurrent nets: a study of prefixing in process calculi
Theoretical Computer Science - Expressiveness in concurrency
Theoretical Computer Science - Mathematical foundations of computer science 2000
Theoretical Computer Science - Logic, language, information and computation
Expressiveness of Process Algebras
Electronic Notes in Theoretical Computer Science (ENTCS)
An exact correspondence between a typed pi-calculus and polarised proof-nets
Theoretical Computer Science
Interpreting a finitary pi-calculus in differential interaction nets
Information and Computation
Towards a unified approach to encodability and separation results for process calculi
Information and Computation
An interaction net implementation of closed reduction
IFL'08 Proceedings of the 20th international conference on Implementation and application of functional languages
Hi-index | 0.00 |
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.