{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T13:11:43Z","timestamp":1791292303345,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540583387","type":"print"},{"value":"9783540486633","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58338-6_102","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:51:22Z","timestamp":1330271482000},"page":"556-566","source":"Crossref","is-referenced-by-count":11,"title":["Critical pairs in term graph rewriting"],"prefix":"10.1007","author":[{"given":"Detlef","family":"Plump","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"48_CR1","doi-asserted-by":"crossref","unstructured":"H. Barendregt, M. van Eekelen, J. Glauert, R. Kennaway, R. Plasmeijer, and 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":"48_CR2","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0304-3975(93)90063-Y","volume":"109","author":"A. Corradini","year":"1993","unstructured":"A. Corradini and F. Rossi. Hyperedge replacement jungle rewriting for term rewriting systems and logic programming. Theoretical Computer Science, 109:7\u201348, 1993.","journal-title":"Theoretical Computer Science"},{"key":"48_CR3","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 6. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"48_CR4","doi-asserted-by":"crossref","unstructured":"W. M. Farmer and R. J. Watro. Redex capturing in term graph rewriting. International Journal on Foundations of Computer Science, 1(4), 1990.","DOI":"10.1142\/S0129054190000266"},{"key":"48_CR5","doi-asserted-by":"crossref","unstructured":"J. H. Fasel and R. M. Keller, editors. Graph Reduction. Springer Lecture Notes in Computer Science 279, 1987.","DOI":"10.1007\/3-540-18420-1"},{"key":"48_CR6","doi-asserted-by":"crossref","unstructured":"J. Goguen, C. Kirchner, and J. Meseguer. Concurrent term rewriting as a model of computation. In Proc. Graph Reduction, pages 53\u201393. Springer Lecture Notes in Computer Science 279, 1987.","DOI":"10.1007\/3-540-18420-1_50"},{"issue":"5","key":"48_CR7","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1051\/ita\/1991250504451","volume":"25","author":"B. Hoffmann","year":"1991","unstructured":"B. Hoffmann and D. 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":"48_CR8","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"G. 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":"48_CR9","unstructured":"J.-P. Jouannaud, H. Kirchner, and J.-L. R\u00e9my. Church-rosser properties of weakly terminating term rewriting systems. In Proc. International Joint Conference on Artificial Intelligence'83, pages 909\u2013915, 1983."},{"key":"48_CR10","unstructured":"J. W. Klop. Term rewriting systems. In S. Abramsky, D. M. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, pages 1\u2013116. Oxford University Press, 1992."},{"key":"48_CR11","doi-asserted-by":"crossref","unstructured":"D. E. Knuth and P. B. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebras, pages 263\u2013297. Pergamon Press, 1970.","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"48_CR12","unstructured":"P. Padawitz. Equational data type specifications and recursive program schemes. In Proc. Formal Descriptions of Programming Concepts-II, pages 305\u2013328. North-Holland, 1983."},{"key":"48_CR13","unstructured":"S. L. Peyton Jones. The Implementation of Functional Programming Languages. Prentice-Hall, 1987."},{"key":"48_CR14","doi-asserted-by":"crossref","unstructured":"D. A. Plaisted. Equational reasoning and term rewriting systems. In D. M. Gabbay and J. Siekmann, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 1. Oxford University Press, 1993.","DOI":"10.1093\/oso\/9780198537458.003.0005"},{"key":"48_CR15","doi-asserted-by":"crossref","unstructured":"D. Plump. Collapsed tree rewriting: Completeness, confluence, and modularity. In Proc. Conditional Term Rewriting Systems, pages 97\u2013112. Springer Lecture Notes in Computer Science 656, 1993.","DOI":"10.1007\/3-540-56393-8_7"},{"key":"48_CR16","unstructured":"D. Plump. Evaluation of functional expressions by hypergraph rewriting. Dissertation, Universit\u00e4t Bremen, Fachbereich Mathematik und Informatik, 1993."},{"key":"48_CR17","unstructured":"D. Plump. Hypergraph rewriting: Critical pairs and undecidability of confluence. In [18], chapter 15."},{"key":"48_CR18","unstructured":"R. Sleep, R. Plasmeijer, and M. van Eekelen, editors. Term Graph Rewriting: Theory and Practice. John Wiley, 1993."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1994"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58338-6_102.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T15:57:39Z","timestamp":1713628659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58338-6_102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540583387","9783540486633"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-58338-6_102","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]}}}