A hierarchy of expressiveness in concurrent interaction nets

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Dorman, A., & Mazza, D. (2013). A hierarchy of expressiveness in concurrent interaction nets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8052 LNCS, pp. 197–211). https://doi.org/10.1007/978-3-642-40184-8_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free