{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:48:21Z","timestamp":1762458501445},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540368342"},{"type":"electronic","value":"9783540368359"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11805618_6","type":"book-chapter","created":{"date-parts":[[2006,7,25]],"date-time":"2006-07-25T14:29:13Z","timestamp":1153837753000},"page":"66-80","source":"Crossref","is-referenced-by-count":5,"title":["Generalizing Newman\u2019s Lemma for Left-Linear Rewrite Systems"],"prefix":"10.1007","author":[{"given":"Bernhard","family":"Gramlich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salvador","family":"Lucas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term rewriting and All That. Cambridge Univ. Press, Cambridge (1998)"},{"volume-title":"Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science 55","year":"2003","key":"6_CR2","unstructured":"Bezem, M., Klop, J.W., de Vrijer, R. (eds.): Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science 55. Cambridge Univ.\u00a0Press, Cambridge (2003)"},{"key":"6_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/3-540-45620-1_27","volume-title":"Automated Deduction - CADE-18","author":"C. Borralleras","year":"2002","unstructured":"Borralleras, C., Lucas, S., Rubio, A.: Recursive path orderings can be context-sensitive. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol.\u00a02392, pp. 314\u2013331. Springer, Heidelberg (2002)"},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0304-3975(91)90040-9","volume":"83","author":"N. Dershowitz","year":"1991","unstructured":"Dershowitz, N., Kaplan, S., Plaisted, D.A.: Rewrite, rewrite, rewrite, rewrite, rewrite,.. Theoretical Computer Science\u00a083(1), 71\u201396 (1991)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"6_CR5","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1017\/S0956796803004945","volume":"14","author":"J. Giesl","year":"2004","unstructured":"Giesl, J., Middeldorp, A.: Transformation techniques for context-sensitive rewrite systems. Journal of Functional Programming\u00a014(4), 379\u2013427 (2004)","journal-title":"Journal of Functional Programming"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/11538363_37","volume-title":"Computer Science Logic","author":"G. Godoy","year":"2005","unstructured":"Godoy, G., Tiwari, A.: Confluence of Shallow Right-Linear Rewrite Systems. In: Ong, L. (ed.) CSL 2005. LNCS, vol.\u00a03634, pp. 541\u2013556. Springer, Heidelberg (2005)"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-36494-3_9","volume-title":"STACS 2003","author":"G. Godoy","year":"2003","unstructured":"Godoy, G., Tiwari, A., Verma, R.M.: On the confluence of linear shallow term rewrite systems. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 85\u201396. Springer, Heidelberg (2003)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/3-540-61064-2_39","volume-title":"Trees in Algebra and Programming - CAAP \u201996","author":"B. Gramlich","year":"1996","unstructured":"Gramlich, B.: Confluence without termination via parallel critical pairs. In: Kirchner, H. (ed.) CAAP 1996. LNCS, vol.\u00a01059, pp. 211\u2013225. Springer, Heidelberg (1996)"},{"key":"6_CR9","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/571157.571163","volume-title":"Proc. 4th PPDP","author":"B. Gramlich","year":"2002","unstructured":"Gramlich, B., Lucas, S.: Modular termination of context-sensitive rewriting. In: Kirchner, C. (ed.) Proc. 4th PPDP, Pittsburgh, PA, USA, pp. 50\u201361. ACM Press, New York (2002)"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2272337","volume":"39","author":"J.R. Hindley","year":"1974","unstructured":"Hindley, J.R.: An abstract Church\u2013Rosser theorem, part ii: Applications. Journal of Symbolic Logic\u00a039, 1\u201321 (1974)","journal-title":"Journal of Symbolic Logic"},{"issue":"4","key":"6_CR11","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"Huet, G.: Confluent reductions: Abstract properties and applications to term rewriting systems. Journal of the ACM\u00a027(4), 797\u2013821 (1980)","journal-title":"Journal of the ACM"},{"issue":"1","key":"6_CR12","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1006\/inco.1995.1075","volume":"119","author":"R. Kennaway","year":"1995","unstructured":"Kennaway, R., Klop, J.W., Sleep, R., de Vries, F.-J.: Transfinite reductions in orthogonal term rewriting systems. Information and Computation\u00a0119(1), 18\u201338 (1995)","journal-title":"Information and Computation"},{"key":"6_CR13","first-page":"2","volume-title":"Handbook of Logic in Computer Science, ch. 1","author":"J.W. Klop","year":"1992","unstructured":"Klop, J.W.: Term rewriting systems. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Logic in Computer Science, ch. 1, vol.\u00a01, pp. 2\u2013117. Clarendon Press, Oxford (1992)"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0020-0190(94)90034-5","volume":"49","author":"J.W. Klop","year":"1994","unstructured":"Klop, J.W., Middeldorp, A., Toyama, Y., de Vrijer, R.: Modularity of confluence: A simplified proof. Information Processing Letters\u00a049, 101\u2013109 (1994)","journal-title":"Information Processing Letters"},{"issue":"1","key":"6_CR15","first-page":"1","volume":"1998","author":"S. Lucas","year":"1998","unstructured":"Lucas, S.: Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming\u00a01998(1), 1\u201361 (1998)","journal-title":"Journal of Functional and Logic Programming"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-45127-7_17","volume-title":"Rewriting Techniques and Applications","author":"S. Lucas","year":"2001","unstructured":"Lucas, S.: Transfinite rewriting semantics for term rewriting systems. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol.\u00a02051, pp. 216\u2013230. Springer, Heidelberg (2001)"},{"issue":"1","key":"6_CR17","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1016\/S0890-5401(02)93176-7","volume":"178","author":"S. Lucas","year":"2002","unstructured":"Lucas, S.: Context-sensitive rewriting strategies. Information and Computation\u00a0178(1), 294\u2013343 (2002)","journal-title":"Information and Computation"},{"issue":"3","key":"6_CR18","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1051\/ita:2005029","volume":"39","author":"S. Lucas","year":"2005","unstructured":"Lucas, S.: Polynomials over the reals in proofs of termination: From theory to practice. RAIRO Theoretical Informatics and Applications\u00a039(3), 547\u2013586 (2005)","journal-title":"RAIRO Theoretical Informatics and Applications"},{"issue":"2","key":"6_CR19","doi-asserted-by":"publisher","first-page":"223","DOI":"10.2307\/1968867","volume":"43","author":"M.H.A. Newman","year":"1942","unstructured":"Newman, M.H.A.: On theories with a combinatorial definition of equivalence. Annals of Mathematics\u00a043(2), 223\u2013242 (1942)","journal-title":"Annals of Mathematics"},{"issue":"1","key":"6_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jsco.1995.1036","volume":"20","author":"E. Ohlebusch","year":"1995","unstructured":"Ohlebusch, E.: Modular properties of composable term rewriting systems. Journal of Symbolic Computation\u00a020(1), 1\u201342 (1995)","journal-title":"Journal of Symbolic Computation"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/BFb0052357","volume-title":"Rewriting Techniques and Applications","author":"S. Okui","year":"1998","unstructured":"Okui, S.: Simultaneous critical pairs and Church-Rosser property. In: Nipkow, T. (ed.) RTA 1998. LNCS, vol.\u00a01379, pp. 2\u201316. Springer, Heidelberg (1998)"},{"issue":"2","key":"6_CR22","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0304-3975(92)00023-K","volume":"126","author":"V. Oostrom van","year":"1994","unstructured":"van Oostrom, V.: Confluence by decreasing diagrams. Theoretical Computer Science\u00a0126(2), 259\u2013280 (1994)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"6_CR23","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0304-3975(96)00173-9","volume":"175","author":"V. Oostrom van","year":"1997","unstructured":"van Oostrom, V.: Developing developments. Theoretical Computer Science\u00a0175(1), 159\u2013181 (1997)","journal-title":"Theoretical Computer Science"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/3-540-62950-5_70","volume-title":"Rewriting Techniques and Applications","author":"M. Oyamaguchi","year":"1997","unstructured":"Oyamaguchi, M., Ohta, Y.: A new parallel closed condition for Church\u2013Rosser of left-linear term rewriting systems. In: Comon, H. (ed.) RTA 1997. LNCS, vol.\u00a01232, pp. 187\u2013201. Springer, Heidelberg (1997)"},{"issue":"4","key":"6_CR25","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1145\/322217.322229","volume":"27","author":"J.C. Raoult","year":"1980","unstructured":"Raoult, J.C., Vuillemin, J.: Operational and semantic equivalence between recursive programs. Journal of the ACM\u00a027(4), 772\u2013796 (1980)","journal-title":"Journal of the ACM"},{"key":"6_CR26","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1145\/321738.321750","volume":"20","author":"B.K. Rosen","year":"1973","unstructured":"Rosen, B.K.: Tree-manipulating systems and Church-Rosser theorems. Journal of the ACM\u00a020, 160\u2013187 (1973)","journal-title":"Journal of the ACM"},{"key":"6_CR27","unstructured":"Toyama, Y.: On the Church\u2013Rosser property of term rewriting systems. ECL Technical Report 17672, NTT (in Japanese) (December 1981)"},{"issue":"1","key":"6_CR28","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1145\/7531.7534","volume":"34","author":"Y. Toyama","year":"1987","unstructured":"Toyama, Y.: On the Church-Rosser property for the direct sum of term rewriting systems. Journal of the ACM\u00a034(1), 128\u2013143 (1987)","journal-title":"Journal of the ACM"},{"key":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1007\/3-540-60381-6_19","volume-title":"Conditional and Typed Rewriting Systems","author":"Y. Toyama","year":"1995","unstructured":"Toyama, Y., Oyamaguchi, M.: Church\u2013Rosser property and unique normal form property of non-duplicating term rewriting systems. In: Lindenstrauss, N., Dershowitz, N. (eds.) CTRS 1994. LNCS, vol.\u00a0968, pp. 316\u2013331. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11805618_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T06:15:53Z","timestamp":1683526553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11805618_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540368342","9783540368359"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/11805618_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}