Skip to main content
SpringerLink
Log in
SpringerLink
Log in

A Hierarchy of Expressiveness in Concurrent Interaction Nets

  • Conference paper
CONCUR 2013 – Concurrency Theory (CONCUR 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8052))

Included in the following conference series:

  • 972 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alexiev, V.: Non-deterministic Interaction Nets. Ph.D. Thesis, University of Alberta (1999)

    Google Scholar 

  2. Asperti, A., Guerrini, S.: The Optimal Implementation of Functional Programming Languages. Cambridge University Press (1998)

    Google Scholar 

  3. Beffara, E., Maurel, F.: Concurrent nets: A study of prefixing in process calculi. Theoretical Computer Science 356(3), 356–373 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Ehrhard, T., Laurent, O.: Interpreting a Finitary Pi-Calculus in Differential Interaction Nets. Information and Computation 208(6), 606–633 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  5. Ehrhard, T., Regnier, L.: Differential Interaction Nets. Theoretical Computer Science 364(2), 166–195 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  6. Fernández, M., Mackie, I.: Operational Equivalence for Interaction Nets. Theoretical Computer Science 297(1-3), 157–181 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  7. 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)

    Google Scholar 

  8. Gorla, D.: Towards a unified approach to encodability and separation results for process calculi. Information and Computation 208(9), 1031–1053 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  9. 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)

    Article  MathSciNet  MATH  Google Scholar 

  10. Lafont, Y.: Interaction nets. In: Allen, F.E. (ed.) Proceedings of POPL, pp. 95–108. ACM Press (1990)

    Google Scholar 

  11. 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)

    Google Scholar 

  12. Lafont, Y.: Interaction Combinators. Information and Computation 137(1), 69–101 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  13. Lamping, J.: An algorithm for optimal lambda calculus reduction. In: Allen, F.E. (ed.) Proceedings of POPL, pp. 16–30. ACM Press (1990)

    Google Scholar 

  14. Laneve, C., Victor, B.: Solos In Concert. Mathematical Structures in Computer Science 13(5), 657–683 (2003)

    Article  MathSciNet  Google Scholar 

  15. Mackie, I.: An Interaction Net Implementation of Additive and Multiplicative Structures. Journal of Logic and Computation 15(2), 219–237 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  16. 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)

    Chapter  Google Scholar 

  17. 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)

    Chapter  Google Scholar 

  18. Mazza, D.: The True Concurrency of Differential Interaction Nets. Mathematical Structures in Computer Science (to appear, 2013) (accepted for publication)

    Google Scholar 

  19. Palamidessi, C.: Comparing the expressive power of the synchronous and asynchronous pi-calculi. Math. Structures Comput. Sci. 13(5), 685–719 (2003)

    Article  MathSciNet  Google Scholar 

  20. Parrow, J.: Expressiveness of Process Algebras. Electronic Notes in Theoretical Computer Science 209, 173–186 (2008)

    Article  MathSciNet  Google Scholar 

  21. Wischik, L., Gardner, P.: Explicit fusions. Theoretical Computer Science 340(3), 606–630 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  22. Yoshida, N.: Graph notation for concurrent combinators. In: Ito, T. (ed.) TPPP 1994. LNCS, vol. 907, pp. 393–412. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Filosofia, Università degli Studi Roma Tre, France

    Andrei Dorman

  2. LIPN, CNRS, Université Paris 13, Sorbonne Paris Cité, France

    Andrei Dorman

  3. CNRS, UMR 7030, LIPN, Université Paris 13, Sorbonne Paris Cité, France

    Damiano Mazza

Authors
  1. Andrei Dorman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Damiano Mazza
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Facultad de Matemáticas, Astronomía y Física, Universidad Nacional de Córdoba – CONICET, Medina Allende s/n,, X5000HUA, Córdoba, Argentina

    Pedro R. D’Argenio

  2. Departamento de Computación,, Universidad de Buenos Aires - Conicet, Intendente Güirales 2160, C1428EGA, Ciudad Autónoma de Buenos Aires, Argentina

    Hernán Melgratti

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation