{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T14:23:10Z","timestamp":1762266190824,"version":"build-2065373602"},"reference-count":28,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,12,1]],"date-time":"1995-12-01T00:00:00Z","timestamp":817776000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1995,12,1]],"date-time":"1995-12-01T00:00:00Z","timestamp":817776000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6438,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1995,12]]},"DOI":"10.1016\/0304-3975(94)00248-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:48:18Z","timestamp":1027630098000},"page":"139-169","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":13,"title":["Modularity in noncopying term rewriting"],"prefix":"10.1016","volume":"152","author":[{"given":"Masahito","family":"Kurihara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Azuma","family":"Ohuchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00248-3_BIB1","series-title":"Proc. 1st Conf. on Parallel Architectures and Languages Europe","first-page":"141","article-title":"Term graph rewriting","volume":"Vol. 259","author":"Barendregt","year":"1987"},{"key":"10.1016\/0304-3975(94)00248-3_BIB2","first-page":"193","article-title":"Graph rewriting: an algebraic and logic approach","volume":"Vol. B","author":"Courcelle","year":"1990"},{"issue":"8","key":"10.1016\/0304-3975(94)00248-3_BIB3","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1145\/359138.359142","article-title":"Proving termination with multiset orderings","volume":"22","author":"Dershowitz","year":"1979","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(94)00248-3_BIB4","first-page":"243","article-title":"Rewrite systems","volume":"Vol. B","author":"Dershowitz","year":"1990"},{"key":"10.1016\/0304-3975(94)00248-3_BIB5","series-title":"Proc. Internat. Workshop on Conditional Term Rewriting Systems","article-title":"Hierarchical termination","author":"Dershowitz","year":"1994"},{"key":"10.1016\/0304-3975(94)00248-3_BIB6","series-title":"Proc. Internat. Conf. on Rewriting Techniques and Applications","first-page":"13","article-title":"Redex capturing in term graph rewriting","volume":"Vol. 488","author":"Farmer","year":"1991"},{"key":"10.1016\/0304-3975(94)00248-3_BIB7","series-title":"Proc. Internat. Conf. on Algebraic and Logic Programming","first-page":"53","article-title":"Generalized sufficient conditions for modular termination of rewriting","volume":"Vol. 632","author":"Gramlich","year":"1992"},{"key":"10.1016\/0304-3975(94)00248-3_BIB8","series-title":"Proc. Conf. on Logic Programming and Automated Reasoning","first-page":"285","article-title":"Relating innermost, weak, uniform and modular termination of term rewriting systems","volume":"Vol. 624","author":"Gramlich","year":"1992"},{"key":"10.1016\/0304-3975(94)00248-3_BIB9","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","article-title":"Confluent reductions: abstract properties and applications to term rewriting systems","volume":"27","author":"Huet","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)00248-3_BIB10","series-title":"Formal Language Theory: Perspectives and Open Problems","first-page":"349","article-title":"Equations and rewrite rules: a survey","author":"Huet","year":"1980"},{"key":"10.1016\/0304-3975(94)00248-3_BIB11","first-page":"143","article-title":"Term rewriting systems: a tutorial","volume":"32","author":"Klop","year":"1987","journal-title":"Bull. European Association for Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00248-3_BIB12","first-page":"1","article-title":"Term rewriting systems","volume":"Vol. II","author":"Klop","year":"1991"},{"key":"10.1016\/0304-3975(94)00248-3_BIB13","series-title":"Proc. Internat. Symp. on Theoretical Aspects of Computer Software","first-page":"203","article-title":"Simple termination of hierarchical combinations of term rewriting systems","volume":"Vol. 789","author":"Rao","year":"1994"},{"key":"10.1016\/0304-3975(94)00248-3_BIB14","first-page":"633","article-title":"Modularity of simple termination of term rewriting systems","volume":"31","author":"Kurihara","year":"1990","journal-title":"J. Inform. Process. Soc. Japan"},{"key":"10.1016\/0304-3975(94)00248-3_BIB15","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0304-3975(92)90015-8","article-title":"Modularity of simple termination of term rewriting systems with shared constructors","volume":"103","author":"Kurihara","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00248-3_BIB16","series-title":"Proc. Internat. Conf. on Rewriting Techniques and Applications","first-page":"263","article-title":"Modular aspects of properties of term rewriting systems related to normal forms","volume":"Vol. 355","author":"Middeldorp","year":"1989"},{"key":"10.1016\/0304-3975(94)00248-3_BIB17","series-title":"Proc 4th IEEE symp. Logic in Computer Science","first-page":"396","article-title":"A sufficient condition for the termination of the direct sum of term rewriting systems","author":"Middeldorp","year":"1989"},{"year":"1990","author":"Middeldorp","article-title":"Modular properties of term rewriting systems","key":"10.1016\/0304-3975(94)00248-3_BIB18"},{"key":"10.1016\/0304-3975(94)00248-3_BIB19","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1006\/jsco.1993.1024","article-title":"Completeness of combinations of constructor systems","volume":"15","author":"Middeldorp","year":"1993","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0304-3975(94)00248-3_BIB20","article-title":"Computing in systems described by equations","volume":"Vol. 58","author":"O'Donnell","year":"1977"},{"year":"1985","author":"O'Donnell","series-title":"Equational Logic as a Programming Language","key":"10.1016\/0304-3975(94)00248-3_BIB21"},{"year":"1993","author":"Ohlebusch","article-title":"On the modularity of termination of term rewriting systems","key":"10.1016\/0304-3975(94)00248-3_BIB22"},{"key":"10.1016\/0304-3975(94)00248-3_BIB23","series-title":"Proc. Internat. Workshop on Conditional and Typed term Rewriting Systems","first-page":"307","article-title":"Implementing term rewriting by graph reduction: termination of combined systems","volume":"Vol. 516","author":"Plump","year":"1990"},{"key":"10.1016\/0304-3975(94)00248-3_BIB24","series-title":"Proc. Internat. Workshop on Conditional Term Rewriting Systems","first-page":"97","article-title":"Collapsed tree rewriting: completeness, confluence, and modularity","volume":"Vol, 656","author":"Plump","year":"1992"},{"key":"10.1016\/0304-3975(94)00248-3_BIB25","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0020-0190(87)90039-1","article-title":"On termination of the direct sum of term-rewriting systems","volume":"26","author":"Rusinowitch","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(94)00248-3_BIB26","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1145\/7531.7534","article-title":"On the Church-Rosser property for the direct sum of term rewriting systems","volume":"34","author":"Toyama","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)00248-3_BIB27","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0020-0190(87)90122-0","article-title":"Counterexamples to termination for the direct sum of term rewriting systems","volume":"25","author":"Toyama","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(94)00248-3_BIB28","series-title":"Proc. Internat. Conf. on Rewriting Techniques and Applications","first-page":"477","article-title":"Termination for the direct sum of left-linear term rewriting systems (preliminary draft)","volume":"Vol. 355","author":"Toyama","year":"1989"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594002483?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594002483?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T14:18:22Z","timestamp":1762265902000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594002483"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,12]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,12]]}},"alternative-id":["0304397594002483"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00248-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1995,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Modularity in noncopying term rewriting","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(94)00248-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1995 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}