{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:59Z","timestamp":1725664979471},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617563"},{"type":"electronic","value":"9783540706540"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61756-6_94","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:20:47Z","timestamp":1330294847000},"page":"319-333","source":"Crossref","is-referenced-by-count":5,"title":["From term rewriting to generalised interaction nets"],"prefix":"10.1007","author":[{"given":"Maribel","family":"Fern\u00e1ndez","sequence":"first","affiliation":[]},{"given":"Ian","family":"Mackie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite Systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science: Formal Methods and Semantics, volume B. North-Holland, 1989.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"M. Fern\u00e1ndez and I. Mackie. Interaction nets and term rewriting systems (extended abstract). In H. Kirchner, editor, Trees in Algebra and Programming \u2014 CAAP'96, number 1059 in LNCS, Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61064-2_35"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"G. Gonthier, M. Abadi, and J.-J. L\u00e9vy. The geometry of optimal lambda reduction. In Proc. ACM Symposium Principles of Programming Languages, 1992.","DOI":"10.1145\/143165.143172"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"C. Hankin, I. Mackie, and R. Nagarajan, editors. Theory and Formal Methods of Computing 94: Proceedings of the Second Imperial College Workshop. Imperial College Press, 1995.","DOI":"10.1142\/9781783263493"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"K. Honda and N. Yoshida. Combinatory representation of mobile processes. In Proc. 21st ACM Symposium on Principles of Programming Languages, 1994.","DOI":"10.1145\/174675.177953"},{"issue":"3","key":"22_CR6","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1145\/177492.177577","volume":"16","author":"J. R. Kennaway","year":"1994","unstructured":"J. R. Kennaway, J. W. Klop, M. R. Sleep, and F. J. de Vries. On the adequacy of graph rewriting for simulating term rewriting. ACM TOPLAS, 16(3):493\u2013523, 1994.","journal-title":"ACM TOPLAS"},{"key":"22_CR7","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(90)90036-H","volume":"72","author":"J. Kennaway","year":"1990","unstructured":"J. Kennaway. Implementing term rewrite languages in DACTL. Theoretical Computer Science, 72:225\u2013249, 1990.","journal-title":"Theoretical Computer Science"},{"key":"22_CR8","unstructured":"J.-W. Klop. Term Rewriting Systems. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, volume 2. Oxford University Press, 1992."},{"key":"22_CR9","unstructured":"M. Kurihara and A. Ohuchi. Non-copying term rewriting and modularity of termination. Hokkaido University."},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Y. Lafont. Interaction nets. In Proc. 17th ACM Symposium on Principles of Programming Languages, 1990.","DOI":"10.1145\/96709.96718"},{"key":"22_CR11","unstructured":"C. Laneve. Optimality and Concurrency in Interaction Systems. PhD thesis, Universit\u00e0 degli Studi di Pisa, 1993."},{"key":"22_CR12","unstructured":"I. Mackie. A \u03bb-evaluator based on interaction nets. In Hankin et al. [4]."},{"key":"22_CR13","unstructured":"R. Milner. The polyadic \u03c0-calculus: A tutorial. Technical Report 91-180, LFCS, Department of Computer Science, University of Edinburgh, 1991."},{"key":"22_CR14","unstructured":"R. Milner. Action calculi II: \u03c0-nets with boxes and replication. Technical report, LFCS, Department of Computer Science, University of Edinburgh, 1993."},{"key":"22_CR15","unstructured":"R. Milner, M. Tofte, and R. Harper. The Definition of Standard ML. MIT Press, 1990."},{"issue":"6","key":"22_CR16","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1145\/113446.113470","volume":"26","author":"J. Reppy","year":"1991","unstructured":"J. Reppy. CML: A higher-order concurrent language. ACM SIGPLAN Notices, 26(6):294\u2013305, 1991.","journal-title":"ACM SIGPLAN Notices"},{"key":"22_CR17","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/0890-5401(87)90050-2","volume":"72","author":"S. Thatte","year":"1987","unstructured":"S. Thatte. A refinement of strong sequentiality for term rewriting systems with constructors. Information and Computation, 72:46\u201365, 1987.","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Programming Languages: Implementations, Logics, and Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61756-6_94.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:10:24Z","timestamp":1605647424000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61756-6_94"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617563","9783540706540"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-61756-6_94","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}