{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:21:59Z","timestamp":1725495719434},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540643012"},{"type":"electronic","value":"9783540697213"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0052358","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T05:31:11Z","timestamp":1149658271000},"page":"17-31","source":"Crossref","is-referenced-by-count":8,"title":["Church-Rosser theorems for abstract reduction modulo an equivalence relation"],"prefix":"10.1007","author":[{"given":"Enno","family":"Ohlebusch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,18]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"J. Avenhaus. Reduktionssysteme. Springer Verlag, 1995 (in German).","DOI":"10.1007\/978-3-642-79351-6"},{"key":"3_CR2","unstructured":"A. Geser. Relative Termination. PhD thesis, Universit\u00e4t Passau, 1990."},{"key":"3_CR3","unstructured":"R. Hindley. The Church-Rosser Property and a Result in Combinatory Logic. PhD thesis, University of Newcastle-upon-Tyne, 1964."},{"issue":"4","key":"3_CR4","doi-asserted-by":"publisher","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. J. of the ACM\n                        27 (4), pages 797\u2013821, 1980.","journal-title":"J. of the ACM"},{"issue":"4","key":"3_CR5","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1137\/0215084","volume":"15","author":"J.-P. Jouannaud","year":"1986","unstructured":"J.-P. Jouannaud and H. Kirchner. Completion of a Set of Rules Modulo a Set of Equations. SIAM J. on Computing\n                        15 (4), pages 1155\u20131194, 1986.","journal-title":"SIAM J. on Computing"},{"key":"3_CR6","first-page":"175","volume":"170","author":"J.-P. Jouannaud","year":"1984","unstructured":"J.-P. Jouannaud and M. Munoz. Termination of a Set of Rules Modulo a Set of Equations. In Proceedings of the 7th International Conference on Automated Deduction, pages 175\u2013193. LNCS 170, 1984.","journal-title":"LNCS"},{"key":"3_CR7","unstructured":"J.W. Klop. Term Rewriting Systems. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, pages 1\u2013116. Oxford University Press, 1992."},{"key":"3_CR8","first-page":"144","volume":"1298","author":"E. Ohlebusch","year":"1997","unstructured":"E. Ohlebusch. Conditional Graph Rewriting. In Proceedings of the 6th International Conference on Algebraic and Logic Programming, pages 144\u2013158. LNCS 1298, 1997.","journal-title":"LNCS"},{"issue":"2","key":"3_CR9","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0304-3975(92)00023-K","volume":"126","author":"V. Oostrom van","year":"1994","unstructured":"V. van Oostrom. Confluence by Decreasing Diagrams. Theoretical Computer Science\n                        126 (2), pages 259\u2013280, 1994.","journal-title":"Theoretical Computer Science"},{"key":"3_CR10","unstructured":"V. van Oostrom. Confluence for Abstract and Higher-Order Rewriting. PhD thesis, Vrije Universiteit te Amsterdam, 1994."},{"key":"3_CR11","first-page":"278","volume":"813","author":"R. P. P\u00e9rez","year":"1994","unstructured":"R. Pino P\u00e9rez and Ch. Even. An Abstract Property of Confluence Applied to the Study of the Lazy Partial Lambda Calculus. In Proceedings of the 3rd International Symposium on Logical Foundations of Computer Science, pages 278\u2013290. LNCS 813, 1994.","journal-title":"LNCS"},{"issue":"1","key":"3_CR12","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1145\/321738.321750","volume":"20","author":"B.K. Rosen","year":"1973","unstructured":"B.K. Rosen. Tree-Manipulating Systems and Church-Rosser Theorems. J. of the ACM\n                        20(1), pages 160\u2013187, 1973.","journal-title":"J. of the ACM"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1145\/321850.321862","volume":"21","author":"R. Sethi","year":"1974","unstructured":"R. Sethi. Testing for the Church-Rosser Property. J. of the ACM\n                        21, pages 671\u2013679, 1974.","journal-title":"J. of the ACM"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"J. Staples. Church-Rosser Theorems for Replacement Systems. In J. Crosley, editor, Algebra and Logic, pages 291\u2013307. Lecture Notes in Mathematics 450, 1975.","DOI":"10.1007\/BFb0062861"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0052358","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,10]],"date-time":"2019-02-10T23:11:20Z","timestamp":1549840280000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0052358"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540643012","9783540697213"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0052358","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}