{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:21:56Z","timestamp":1725664916719},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540610649"},{"type":"electronic","value":"9783540499442"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61064-2_35","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:15:01Z","timestamp":1330272901000},"page":"149-164","source":"Crossref","is-referenced-by-count":2,"title":["Interaction nets and term rewriting systems (extended abstract)"],"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,2]]},"reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3(1):69\u2013115, 1987.","journal-title":"Journal of Symbolic Computation"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"N. Dershowitz. Hierarchical termination. In Proc. Conditional and Typed Term Rewriting Systems, LNCS, 1995.","DOI":"10.1007\/3-540-60381-6_6"},{"key":"12_CR3","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite Systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, vol. B. North-Holland, 1989."},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"M. Fern\u00e1ndez and J.-P. Jouannaud. Modular termination of term rewriting systems revisited. In Recent Trends in Data Type Specification. Proc. 10th. Workshop on Specification of Abstract Data Types, number 906 in LNCS, 1995.","DOI":"10.1007\/BFb0014432"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"M. Fern\u00e1ndez and I. Mackie. From term rewriting systems to generalised interaction nets, 1996. Submitted for publication.","DOI":"10.1007\/3-540-61756-6_94"},{"key":"12_CR6","unstructured":"S. Gay. Combinators for interaction nets. In C. Hankin, I. Mackie, and R. Nagarajan, eds., Proceedings of the 2nd Imperial College, Department of Computing, Workshop on Theory and Formal Methods. Imperial College Press, 1995."},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"J.-P. Jouannaud. Rewrite proofs and computations. In H. Schwichtenberg, ed., Proof and Computation, vol. 139 of Computer and Systems Sciences. Springer-Verlag, 1995.","DOI":"10.1007\/978-3-642-79361-5_7"},{"key":"12_CR8","unstructured":"J. R. Kennaway, J. W. Klop, M. R. Sleep, and F. J. de Vries. Transfinite reductions in orthogonal term rewriting systems. Information and Computation. To appear."},{"key":"12_CR9","unstructured":"J. Klop. Term Rewriting Systems. In S. Abramsky, D. Gabbay, and T. Maibaum, eds., Handbook of Logic in Computer Science, vol. 2. Oxford University Press, 1992."},{"key":"12_CR10","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(93)90091-7","volume":"121","author":"J. Klop","year":"1993","unstructured":"J. Klop, V. van Oostrom, and F. van Raamsdonk. Combinatory reduction systems, introduction and survey. Theoretical Computer Science, 121:279\u2013308, 1993.","journal-title":"Theoretical Computer Science"},{"key":"12_CR11","unstructured":"M. R. K. Krishna Rao. Completeness of hierarchical combinations of term rewriting systems. In Proc. of FST & TCS'93, number 761 in LNCS, 1993."},{"key":"12_CR12","unstructured":"M. Kurihara and A. Ohuchi. Non-copying term rewriting and modularity of termination. Hokkaido University."},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Y. Lafont. Interaction nets. In Proceedings, 17th ACM Symposium on Principles of Programming Languages, 1990.","DOI":"10.1145\/96709.96718"},{"key":"12_CR14","unstructured":"C. Laneve. Optimality and Concurrency in Interaction Systems. PhD thesis, Dipartmento di Informatica, Universit\u00e0 degli Studi di Pisa, 1993."},{"key":"12_CR15","unstructured":"I. Mackie. The Geometry of Implementation. PhD thesis, Department of Computing, Imperial College of Science Technology and Medicine, 1994."},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"A. Middeldorp and Y. Toyama. Completeness of combinations of constructor systems. In Proc. 4th Rewriting Techniques and Applications, number 488 in LNCS, 1991.","DOI":"10.1007\/3-540-53904-2_96"},{"key":"12_CR17","unstructured":"M. Sleep, M. Plasmeijer, and M. van Eekelen. Term Graph Rewriting, Practice and Experience. John Wiley and Sons Ltd, 1993."}],"container-title":["Lecture Notes in Computer Science","Trees in Algebra and Programming \u2014 CAAP '96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61064-2_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:04:04Z","timestamp":1605629044000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61064-2_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540610649","9783540499442"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-61064-2_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}