{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T04:59:39Z","timestamp":1790744379196,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642401831","type":"print"},{"value":"9783642401848","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40184-8_15","type":"book-chapter","created":{"date-parts":[[2013,7,22]],"date-time":"2013-07-22T21:50:56Z","timestamp":1374529856000},"page":"197-211","source":"Crossref","is-referenced-by-count":1,"title":["A Hierarchy of Expressiveness in Concurrent Interaction Nets"],"prefix":"10.1007","author":[{"given":"Andrei","family":"Dorman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Damiano","family":"Mazza","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Alexiev, V.: Non-deterministic Interaction Nets. Ph.D. Thesis, University of Alberta (1999)"},{"key":"15_CR2","unstructured":"Asperti, A., Guerrini, S.: The Optimal Implementation of Functional Programming Languages. Cambridge University Press (1998)"},{"issue":"3","key":"15_CR3","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/j.tcs.2006.02.009","volume":"356","author":"E. Beffara","year":"2006","unstructured":"Beffara, E., Maurel, F.: Concurrent nets: A study of prefixing in process calculi. Theoretical Computer Science\u00a0356(3), 356\u2013373 (2006)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"15_CR4","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1016\/j.ic.2009.06.005","volume":"208","author":"T. Ehrhard","year":"2010","unstructured":"Ehrhard, T., Laurent, O.: Interpreting a Finitary Pi-Calculus in Differential Interaction Nets. Information and Computation\u00a0208(6), 606\u2013633 (2010)","journal-title":"Information and Computation"},{"issue":"2","key":"15_CR5","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.tcs.2006.08.003","volume":"364","author":"T. Ehrhard","year":"2006","unstructured":"Ehrhard, T., Regnier, L.: Differential Interaction Nets. Theoretical Computer Science\u00a0364(2), 166\u2013195 (2006)","journal-title":"Theoretical Computer Science"},{"issue":"1-3","key":"15_CR6","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0304-3975(02)00637-0","volume":"297","author":"M. Fern\u00e1ndez","year":"2003","unstructured":"Fern\u00e1ndez, M., Mackie, I.: Operational Equivalence for Interaction Nets. Theoretical Computer Science\u00a0297(1-3), 157\u2013181 (2003)","journal-title":"Theoretical Computer Science"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Gonthier, G., Abadi, M., L\u00e9vy, J.J.: The geometry of optimal lambda reduction. In: Sethi, R. (ed.) Proceedings of POPL, pp. 15\u201326. ACM Press (1992)","DOI":"10.1145\/143165.143172"},{"issue":"9","key":"15_CR8","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1016\/j.ic.2010.05.002","volume":"208","author":"D. Gorla","year":"2010","unstructured":"Gorla, D.: Towards a unified approach to encodability and separation results for process calculi. Information and Computation\u00a0208(9), 1031\u20131053 (2010)","journal-title":"Information and Computation"},{"issue":"22-24","key":"15_CR9","doi-asserted-by":"publisher","first-page":"2223","DOI":"10.1016\/j.tcs.2010.01.028","volume":"411","author":"K. Honda","year":"2010","unstructured":"Honda, K., Laurent, O.: An exact correspondence between a typed pi-calculus and polarised proof-nets. Theor. Comput. Sci.\u00a0411(22-24), 2223\u20132238 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Lafont, Y.: Interaction nets. In: Allen, F.E. (ed.) Proceedings of POPL, pp. 95\u2013108. ACM Press (1990)","DOI":"10.1145\/96709.96718"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Lafont, Y.: From proof nets to interaction nets. In: Girard, J.Y., Lafont, Y., Regnier, L. (eds.) Advances in Linear Logic, pp. 225\u2013247. Cambridge University Press (1995)","DOI":"10.1017\/CBO9780511629150.012"},{"issue":"1","key":"15_CR12","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1006\/inco.1997.2643","volume":"137","author":"Y. Lafont","year":"1997","unstructured":"Lafont, Y.: Interaction Combinators. Information and Computation\u00a0137(1), 69\u2013101 (1997)","journal-title":"Information and Computation"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Lamping, J.: An algorithm for optimal lambda calculus reduction. In: Allen, F.E. (ed.) Proceedings of POPL, pp. 16\u201330. ACM Press (1990)","DOI":"10.1145\/96709.96711"},{"issue":"5","key":"15_CR14","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1017\/S0960129503004055","volume":"13","author":"C. Laneve","year":"2003","unstructured":"Laneve, C., Victor, B.: Solos In Concert. Mathematical Structures in Computer Science\u00a013(5), 657\u2013683 (2003)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"2","key":"15_CR15","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1093\/logcom\/exi011","volume":"15","author":"I. Mackie","year":"2005","unstructured":"Mackie, I.: An Interaction Net Implementation of Additive and Multiplicative Structures. Journal of Logic and Computation\u00a015(2), 219\u2013237 (2005)","journal-title":"Journal of Logic and Computation"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-642-24452-0_3","volume-title":"Implementation and Application of Functional Languages","author":"I. Mackie","year":"2011","unstructured":"Mackie, I.: An interaction net implementation of closed reduction. In: Scholz, S.-B., Chitil, O. (eds.) IFL 2008. LNCS, vol.\u00a05836, pp. 43\u201359. Springer, Heidelberg (2011)"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/11539452_6","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"D. Mazza","year":"2005","unstructured":"Mazza, D.: Multiport Interaction Nets and Concurrency. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 21\u201335. Springer, Heidelberg (2005)"},{"key":"15_CR18","unstructured":"Mazza, D.: The True Concurrency of Differential Interaction Nets. Mathematical Structures in Computer Science (to appear, 2013) (accepted for publication)"},{"issue":"5","key":"15_CR19","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1017\/S0960129503004043","volume":"13","author":"C. Palamidessi","year":"2003","unstructured":"Palamidessi, C.: Comparing the expressive power of the synchronous and asynchronous pi-calculi. Math. Structures Comput. Sci.\u00a013(5), 685\u2013719 (2003)","journal-title":"Math. Structures Comput. Sci."},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.entcs.2008.04.011","volume":"209","author":"J. Parrow","year":"2008","unstructured":"Parrow, J.: Expressiveness of Process Algebras. Electronic Notes in Theoretical Computer Science\u00a0209, 173\u2013186 (2008)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"issue":"3","key":"15_CR21","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1016\/j.tcs.2005.03.017","volume":"340","author":"L. Wischik","year":"2005","unstructured":"Wischik, L., Gardner, P.: Explicit fusions. Theoretical Computer Science\u00a0340(3), 606\u2013630 (2005)","journal-title":"Theoretical Computer Science"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/BFb0026581","volume-title":"Theory and Practice of Parallel Programming","author":"N. Yoshida","year":"1995","unstructured":"Yoshida, N.: Graph notation for concurrent combinators. In: Ito, T. (ed.) TPPP 1994. LNCS, vol.\u00a0907, pp. 393\u2013412. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2013 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40184-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T22:55:27Z","timestamp":1557960927000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40184-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401831","9783642401848"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40184-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}