{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:23Z","timestamp":1725455903594},"publisher-location":"Berlin\/Heidelberg","reference-count":9,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354054478X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0017417","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:32:12Z","timestamp":1132644732000},"page":"622-636","source":"Crossref","is-referenced-by-count":3,"title":["Graph-reducible term rewriting systems"],"prefix":"10.1007","author":[{"given":"Detlef","family":"Plump","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"45_CR1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/3-540-17945-3_8","volume":"259","author":"H.P. Barendregt","year":"1987","unstructured":"H.P. Barendregt, M.C.J.D. van Eekelen, J.R.W. Glauert, J.R. Kennaway, M.J. Plasmeijer, M.R. Sleep: Term Graph Rewriting. Proc. PARLE, Lecture Notes in Comp. Sci. 259, 141\u2013158 (1987)","journal-title":"Lecture Notes in Comp. Sci."},{"issue":"1\/2","key":"45_CR2","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, vol. 3, no. 1\/2, 69\u2013115 (1987). Corrigendum: vol. 4, no. 3, 409\u2013410","journal-title":"Journal of Symbolic Computation"},{"key":"45_CR3","doi-asserted-by":"crossref","unstructured":"N. Dershowitz, J.-P. Jouannaud: Rewrite Systems. In J. van Leeuwen (ed.): Handbook of Theoretical Computer Science. Vol. B, North-Holland (1990)","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"45_CR4","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1007\/3-540-50325-0_5","volume":"332","author":"A. Habel","year":"1988","unstructured":"A. Habel, H.-J. Kreowski, D. Plump: Jungle Evaluation. Proc. Fifth Workshop on Specification of Abstract Data Types, Lecture Notes in Comp. Sci. 332, 92\u2013112 (1988)","journal-title":"Lecture Notes in Comp. Sci."},{"key":"45_CR5","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/3-540-50667-5_71","volume-title":"Jungle Evaluation for Efficient Term Rewriting. Proc. Algebraic and Logic Programming","author":"B. Hoffmann","year":"1988","unstructured":"B. Hoffmann, D. Plump: Jungle Evaluation for Efficient Term Rewriting. Proc. Algebraic and Logic Programming, Akademie-Verlag, Berlin, 191\u2013203 (1988). Also in Lecture Notes in Comp. Sci. 343 (1989). Long version to appear in RAIRO Theoretical Informatics and Applications"},{"key":"45_CR6","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/BFb0032044","volume":"443","author":"J.W. Klop","year":"1990","unstructured":"J.W. Klop: Term Rewriting Systems \u2014 From Church-Rosser to Knuth-Bendix and Beyond. Proc. ICALP '90, Lecture Notes in Comp. Sci. 443, 350\u2013369 (1990)","journal-title":"Lecture Notes in Comp. Sci."},{"key":"45_CR7","doi-asserted-by":"crossref","unstructured":"M.J. O'Donnell: Computing in Systems Described by Equations. Lecture Notes in Comp. Sci. 58 (1977)","DOI":"10.1007\/3-540-08531-9"},{"key":"45_CR8","doi-asserted-by":"crossref","unstructured":"D. Plump: Implementing Term Rewriting by Graph Reduction: Termination of Combined Systems. Proc. 2nd Int. Workshop on Conditional and Typed Rewriting Systems, Montreal 1990, to appear in Lecture Notes in Comp. Sci.","DOI":"10.1007\/3-540-54317-1_100"},{"key":"45_CR9","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0020-0190(87)90122-0","volume":"25","author":"Y. Toyama","year":"1987","unstructured":"Y. Toyama: Counterexamples to Termination for the Direct Sum of Term Rewriting Systems. Information Process. Lett. 25, 141\u2013143 (1987)","journal-title":"Information Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Graph Grammars and Their Application to Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017417.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:38:30Z","timestamp":1607549910000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017417"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354054478X"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0017417","relation":{},"subject":[]}}