{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T19:01:08Z","timestamp":1725476468119},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540665403"},{"type":"electronic","value":"9783540481645"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/10704567_10","type":"book-chapter","created":{"date-parts":[[2006,12,28]],"date-time":"2006-12-28T18:27:08Z","timestamp":1167330428000},"page":"170-187","source":"Crossref","is-referenced-by-count":16,"title":["A Calculus for Interaction Nets"],"prefix":"10.1007","author":[{"given":"Maribel","family":"Fern\u00e1ndez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian","family":"Mackie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(93)90181-R","volume":"111","author":"S. Abramsky","year":"1993","unstructured":"Abramsky, S.: Computational Interpretations of Linear Logic. Theoretical Computer Science\u00a0111, 3\u201357 (1993)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"10_CR2","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1006\/inco.1997.2651","volume":"139","author":"Z.M. Ariola","year":"1997","unstructured":"Ariola, Z.M., Klop, J.W.: Lambda calculus with explicit recursion. Information and Computation\u00a0139(2), 154\u2013233 (1997)","journal-title":"Information and Computation"},{"key":"10_CR3","unstructured":"Banach, R.: The algebraic theory of interaction nets. Technical Report UMCS-95- 7-2, University of Manchester (1995)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Bawden, A.: Connection graphs. In: Proceedings of ACM Conference on Lisp and Functional Programming, pp. 258\u2013265 (1986)","DOI":"10.1145\/319838.319868"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01622878","volume":"28","author":"V. Danos","year":"1989","unstructured":"Danos, V., Regnier, L.: The structure of multiplicatives. Archive for Mathematical Logic\u00a028, 181\u2013203 (1989)","journal-title":"Archive for Mathematical Logic"},{"issue":"6","key":"10_CR6","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1017\/S0960129598002679","volume":"8","author":"M. Fern\u00e1ndez","year":"1998","unstructured":"Fern\u00e1ndez, M.: Type assignment and termination of interaction nets. Mathematical Structures in Computer Science\u00a08(6), 593\u2013636 (1998)","journal-title":"Mathematical Structures in Computer Science"},{"key":"10_CR7","first-page":"321","volume-title":"Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science (LICS 1998)","author":"M. Fern\u00e1ndez","year":"1998","unstructured":"Fern\u00e1ndez, M., Mackie, I.: Coinductive techniques for operational equivalence of interaction nets. In: Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science (LICS 1998), pp. 321\u2013332. IEEE Computer Society Press, Los Alamitos (1998)"},{"issue":"1","key":"10_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(97)00082-0","volume":"190","author":"M. Fern\u00e1ndez","year":"1998","unstructured":"Fern\u00e1ndez, M., Mackie, I.: Interaction nets and term rewriting systems. Theoretical Computer Science\u00a0190(1), 3\u201339 (1998)","journal-title":"Theoretical Computer Science"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/143165.143172","volume-title":"Proceedings of the 19th ACM Symposium on Principles of Programming Languages (POPL 1992)","author":"G. Gonthier","year":"1992","unstructured":"Gonthier, G., Abadi, M., L\u00e9vy, J.-J.: The geometry of optimal lambda reduction. In: Proceedings of the 19th ACM Symposium on Principles of Programming Languages (POPL 1992), pp. 15\u201326. ACM Press, New York (1992)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR\u201993","author":"K. Honda","year":"1993","unstructured":"Honda, K.: Types for dyadic interaction. In: Best, E. (ed.) CONCUR 1993. LNCS, vol.\u00a0715. Springer, Heidelberg (1993)"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(93)90091-7","volume":"121","author":"J.-W. Klop","year":"1993","unstructured":"Klop, J.-W., van Oostrom, V., van Raamsdonk, F.: Combinatory reduction systems, introduction and survey. Theoretical Computer Science\u00a0121, 279\u2013308 (1993)","journal-title":"Theoretical Computer Science"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1145\/96709.96718","volume-title":"Proceedings of the 17th ACM Symposium on Principles of Programming Languages (POPL 1990)","author":"Y. Lafont","year":"1990","unstructured":"Lafont, Y.: Interaction nets. In: Proceedings of the 17th ACM Symposium on Principles of Programming Languages (POPL 1990), pp. 95\u2013108. ACM Press, New York (1990)"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/96709.96711","volume-title":"Proceedings of the 17th ACM Symposium on Principles of Programming Languages (POPL 1990)","author":"J. Lamping","year":"1990","unstructured":"Lamping, J.: An algorithm for optimal lambda calculus reduction. In: Proceedings of the 17th ACM Symposium on Principles of Programming Languages (POPL 1990), pp. 16\u201330. ACM Press, New York (1990)"},{"key":"10_CR14","unstructured":"Laneve, C.: Optimality and Concurrency in Interaction Systems. PhD thesis, Dipartmento di Informatica, Universit\u00e1 degli Studi di Pisa (1993)"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BFb0032744","volume-title":"Proceedings of the 4th International Static Analysis ymposium (SAS 1997)","author":"I. Mackie","year":"1997","unstructured":"Mackie, I.: Static analysis of interaction nets for distributed implementations. In: Van Hentenryck, P. (ed.) SAS 1997. LNCS, vol.\u00a01302, pp. 217\u2013231. Springer, Heidelberg (1997)"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/289423.289434","volume-title":"Proceedings of the 3rd ACM SIGPLAN International Conference on Functional Programming (ICFP 1998)","author":"I. Mackie","year":"1998","unstructured":"Mackie, I.: YALE: Yet another lambda evaluator based on interaction nets. In: Proceedings of the 3rd ACM SIGPLAN International Conference on Functional Programming (ICFP 1998), pp. 117\u2013128. ACM Press, New York (1998)"},{"key":"10_CR17","unstructured":"Pinto, J.S.: An abstract machine for interaction nets, \u00c9cole Polytechnique (1999)"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","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., Yonezawa, A. (eds.) TPPP 1994. LNCS, vol.\u00a0907, pp. 364\u2013397. Springer, Heidelberg (1995)"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BFb0055620","volume-title":"CONCUR \u201998 Concurrency Theory","author":"N. Yoshida","year":"1998","unstructured":"Yoshida, N.: Minimality and separation results on asynchronous mobile processes: Representability theorems by concurrent combinators. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 131\u2013146. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10704567_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T23:06:02Z","timestamp":1552863962000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10704567_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665403","9783540481645"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/10704567_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}