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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alexiev, V.: Non-deterministic Interaction Nets. Ph.D. Thesis, University of Alberta (1999)
Asperti, A., Guerrini, S.: The Optimal Implementation of Functional Programming Languages. Cambridge University Press (1998)
Beffara, E., Maurel, F.: Concurrent nets: A study of prefixing in process calculi. Theoretical Computer Science 356(3), 356–373 (2006)
Ehrhard, T., Laurent, O.: Interpreting a Finitary Pi-Calculus in Differential Interaction Nets. Information and Computation 208(6), 606–633 (2010)
Ehrhard, T., Regnier, L.: Differential Interaction Nets. Theoretical Computer Science 364(2), 166–195 (2006)
Fernández, M., Mackie, I.: Operational Equivalence for Interaction Nets. Theoretical Computer Science 297(1-3), 157–181 (2003)
Gonthier, G., Abadi, M., Lévy, J.J.: The geometry of optimal lambda reduction. In: Sethi, R. (ed.) Proceedings of POPL, pp. 15–26. ACM Press (1992)
Gorla, D.: Towards a unified approach to encodability and separation results for process calculi. Information and Computation 208(9), 1031–1053 (2010)
Honda, K., Laurent, O.: An exact correspondence between a typed pi-calculus and polarised proof-nets. Theor. Comput. Sci. 411(22-24), 2223–2238 (2010)
Lafont, Y.: Interaction nets. In: Allen, F.E. (ed.) Proceedings of POPL, pp. 95–108. ACM Press (1990)
Lafont, Y.: From proof nets to interaction nets. In: Girard, J.Y., Lafont, Y., Regnier, L. (eds.) Advances in Linear Logic, pp. 225–247. Cambridge University Press (1995)
Lafont, Y.: Interaction Combinators. Information and Computation 137(1), 69–101 (1997)
Lamping, J.: An algorithm for optimal lambda calculus reduction. In: Allen, F.E. (ed.) Proceedings of POPL, pp. 16–30. ACM Press (1990)
Laneve, C., Victor, B.: Solos In Concert. Mathematical Structures in Computer Science 13(5), 657–683 (2003)
Mackie, I.: An Interaction Net Implementation of Additive and Multiplicative Structures. Journal of Logic and Computation 15(2), 219–237 (2005)
Mackie, I.: An interaction net implementation of closed reduction. In: Scholz, S.-B., Chitil, O. (eds.) IFL 2008. LNCS, vol. 5836, pp. 43–59. Springer, Heidelberg (2011)
Mazza, D.: Multiport Interaction Nets and Concurrency. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 21–35. Springer, Heidelberg (2005)
Mazza, D.: The True Concurrency of Differential Interaction Nets. Mathematical Structures in Computer Science (to appear, 2013) (accepted for publication)
Palamidessi, C.: Comparing the expressive power of the synchronous and asynchronous pi-calculi. Math. Structures Comput. Sci. 13(5), 685–719 (2003)
Parrow, J.: Expressiveness of Process Algebras. Electronic Notes in Theoretical Computer Science 209, 173–186 (2008)
Wischik, L., Gardner, P.: Explicit fusions. Theoretical Computer Science 340(3), 606–630 (2005)
Yoshida, N.: Graph notation for concurrent combinators. In: Ito, T. (ed.) TPPP 1994. LNCS, vol. 907, pp. 393–412. Springer, Heidelberg (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dorman, A., Mazza, D. (2013). A Hierarchy of Expressiveness in Concurrent Interaction Nets. In: D’Argenio, P.R., Melgratti, H. (eds) CONCUR 2013 – Concurrency Theory. CONCUR 2013. Lecture Notes in Computer Science, vol 8052. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40184-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-40184-8_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40183-1
Online ISBN: 978-3-642-40184-8
eBook Packages: Computer ScienceComputer Science (R0)