{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:19Z","timestamp":1761611299930},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540563938"},{"type":"electronic","value":"9783540475491"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56393-8_7","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:08:33Z","timestamp":1330254513000},"page":"97-112","source":"Crossref","is-referenced-by-count":9,"title":["Collapsed tree rewriting: Completeness, confluence, and modularity"],"prefix":"10.1007","author":[{"given":"Detlef","family":"Plump","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1017\/S0305004100013463","volume":"31","author":"G. Birkhoff","year":"1935","unstructured":"Garrett Birkhoff. On the structure of abstract algebras. Proceedings of the Cambridge Philosophical Society, 31:433\u2013454, 1935.","journal-title":"Proceedings of the Cambridge Philosophical Society"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"H.P. Barendregt, M.C.J.D. van Eekelen, J.R.W, dauert, J.R. Kennaway, M.J. Plasmeijer, and M.R. Sleep. Term graph rewriting. In Proc. Parallel Architectures and Languages Europe, pages 141\u2013158. Springer Lecture Notes in Computer Science 259, 1987.","DOI":"10.1007\/3-540-17945-3_8"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Pierre-Louis Curien and Giorgio Ghelli. On confluence for weakly normalizing systems. In Proc. Rewriting Techniques and Applications, pages 215\u2013225. Springer Lecture Notes in Computer Science 488, 1991.","DOI":"10.1007\/3-540-53904-2_98"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Andrea Corradini and Francesca Rossi. Hyperedge replacement jungle rewriting for term rewriting systems and logic programming. Theoretical Computer Science, 1992. To appear.","DOI":"10.1016\/0304-3975(93)90063-Y"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, vol. B, chapter 6. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Klaus Drosten. Termersetzungssysteme. Informatik-Fachberichte 210. Springer-Verlag, 1989.","DOI":"10.1007\/978-3-642-74769-4"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Hartmut Ehrig and Hans-J\u00f6rg Kreowski. Parallelism of manipulations in multidimensional information structures. In Proc. Mathematical Foundations of Computer Science, pages 284\u2013293. Springer Lecture Notes in Computer Science 45, 1976.","DOI":"10.1007\/3-540-07854-1_188"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"William M. Farmer and Ronald J. Watro. Redex capturing in term graph rewriting. In Proc. Rewriting Techniques and Applications, pages 13\u201324. Springer Lecture Notes in Computer Science 488, 1991.","DOI":"10.1007\/3-540-53904-2_82"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"G\u00e9rard Huet and Derek C. Oppen. Equations and rewrite rules, a survey. In Ronald V. Book, editor Formal Language Theory: Perspectives and Open Problems, pages 349\u2013405. Academic Press, 1980.","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"issue":"5","key":"7_CR10","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1051\/ita\/1991250504451","volume":"25","author":"B. Hoffmann","year":"1991","unstructured":"Berthold Hoffmann and Detlef Plump. Implementing term rewriting by jungle evaluation. RAIRO Theoretical Informatics and Applications, 25(5):445\u2013472, 1991.","journal-title":"RAIRO Theoretical Informatics and Applications"},{"issue":"4","key":"7_CR11","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"G\u00e9rard Huet. Confluent reductions: Abstract properties and applications to term rewriting systems. Journal of the ACM, 27(4):797\u2013821, 1980.","journal-title":"Journal of the ACM"},{"key":"7_CR12","unstructured":"Jan Willem Klop. Term rewriting systems \u2014 from Church-Rosser to Knuth-Bendix and beyond. In Proc. Automata, Languages, and Programming, pages 350\u2013369. Springer Lecture Notes in Computer Science 443, 1990."},{"key":"7_CR13","volume-title":"Dissertation","author":"A. Middeldorp","year":"1990","unstructured":"Aart Middeldorp. Modular properties of term rewriting systems. Dissertation, Vrije Universiteit, Amsterdam, 1990."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Michael J. O'Donnell. Computing in Systems Described by Equations. Lecture Notes in Computer Science 58. Springer-Verlag, 1977.","DOI":"10.1007\/3-540-08531-9"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Detlef Plump. Implementing term rewriting by graph reduction: Termination of combined systems. In Proc. Conditional and Typed Rewriting Systems, pages 307\u2013317. Springer Lecture Notes in Computer Science 516, 1991.","DOI":"10.1007\/3-540-54317-1_100"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0020-0190(87)90122-0","volume":"25","author":"Y. Toyama","year":"1987","unstructured":"Yoshihito Toyama. Counterexamples to termination for the direct sum of term rewriting systems. Information Processing Letters, 25:141\u2013143, 1987.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Conditional Term Rewriting Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56393-8_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:03:40Z","timestamp":1605647020000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56393-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540563938","9783540475491"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-56393-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}