{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:13Z","timestamp":1725664993242},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540642992"},{"type":"electronic","value":"9783540697190"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-64299-4_38","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:36:29Z","timestamp":1330299389000},"page":"253-268","source":"Crossref","is-referenced-by-count":0,"title":["Modular aspects of rewrite-based specifications"],"prefix":"10.1007","author":[{"given":"Bernhard","family":"Gramlich","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"L. Bachmair and N. Dershowitz. Commutation, transformation, and termination. In J. Siekmann, ed., Proc. 8th CADE, LNCS 230, pp. 5\u201320. Springer, 1986.","DOI":"10.1007\/3-540-16780-3_76"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"N. Dershowitz. Hierarchical termination. In N. Dershowitz and N. Lindenstrauss, eds., Proc. 4th CTRS (1994), LNCS 968, pp. 89\u2013105. Springer, 1995.","DOI":"10.1007\/3-540-60381-6_6"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"N. Dershowitz. Innocuous constructor-sharing combinations. In H. Comon, ed., Proc. 8th RTA, LNCS 1232, pp. 202\u2013216. Springer, 1997.","DOI":"10.1007\/3-540-62950-5_71"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, ed., Formal models and semantics, Handbook of Theoretical Computer Science, volume, B, chapter 6, pp. 243\u2013320. Elsevier-The MIT Press, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"K. Drosten. Termersetzungssysteme. Informatik-Fachberichte 210. Springer, 1989.","DOI":"10.1007\/978-3-642-74769-4"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"M. Fern\u00e1ndez and J.-P. Jouannaud. Modular termination of term rewriting systems revisited. In Recent Trends in Data Type Specification, LNCS 906, pp. 255\u2013272, Springer, 1995.","DOI":"10.1007\/BFb0014432"},{"key":"14_CR7","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01190827","volume":"5","author":"B. Gramlich","year":"1994","unstructured":"B. Gramlich. Generalized sufficient conditions for modular termination of rewriting. Applicable Algebra in Engineering, Communication and Computing, 5:131\u2013158, 1994.","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"14_CR8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/FI-1995-24121","volume":"24","author":"B. Gramlich","year":"1995","unstructured":"B. Gramlich. Abstract relations between restricted termination and confluence properties of rewrite systems. Fundamenta Informaticae, 24:3\u201323, 1995.","journal-title":"Fundamenta Informaticae"},{"key":"14_CR9","unstructured":"B. Gramlich. Termination and Confluence Properties of Structured Rewrite Systems. PhD thesis, Fachbereich Informatik, Universit\u00e4t Kaiserslautern, Jan. 1996."},{"key":"14_CR10","first-page":"2","volume-title":"Handbook of Logic in Computer Science, volume 2","author":"J. W. Klop","year":"1992","unstructured":"J. W. Klop. Term rewriting systems.In S. Abramsky, D. Gabbay, and T. Maibaum, eds., Handbook of Logic in Computer Science, volume 2, chapter 1, pp. 2\u2013117. Clarendon Press, Oxford, 1992."},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0020-0190(94)90034-5","volume":"49","author":"J. W. Klop","year":"1994","unstructured":"J. W. Klop, A. Middeldorp, Y. Toyama, and R. Vrijer. Modularity of confluence: A simplified proof. Information Processing Letters, 49:101\u2013109, 1994.","journal-title":"Information Processing Letters"},{"issue":"2","key":"14_CR12","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1016\/0304-3975(95)00075-8","volume":"151","author":"M.R.K. Krishna Rao","year":"1995","unstructured":"M.R.K. Krishna Rao. Modular proofs for completeness of hierarchical term rewriting systems. Theoretical Computer Science, 151(2):487\u2013512, Nov. 1995.","journal-title":"Theoretical Computer Science"},{"key":"14_CR13","series-title":"Technical Report CS-119433","volume-title":"Modularity of UN\u2192 for left-linear term rewriting systems","author":"M. Marchiori","year":"1994","unstructured":"M. Marchiori. Modularity of UN\u2192 for left-linear term rewriting systems. Technical Report CS-119433, CWI, Amsterdam, May 1994."},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"M. Marchiori. Modularity of Completeness Revisited. In J. Hsiang, ed., Proc. 6th RTA, LNCS 914, pp. 2\u201310. Springer, 1995.","DOI":"10.1007\/3-540-59200-8_43"},{"key":"14_CR15","volume-title":"Modular Properties of Term Rewriting Systems","author":"A. Middeldorp","year":"1990","unstructured":"A. Middeldorp. Modular Properties of Term Rewriting Systems. PhD thesis, Free University, Amsterdam, 1990."},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"A. Middeldorp, H.Ohsaki and H. Zantema. Transforming termination by self-labelling. In Proc. 13th CADE, LNAI 1104, pp. 373\u2013387. Springer, 1996.","DOI":"10.1007\/3-540-61511-3_101"},{"key":"14_CR17","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1006\/jsco.1993.1024","volume":"15","author":"A. Middeldorp","year":"1993","unstructured":"A. Middeldorp and Y. Toyama. Completeness of combinations of constructor systems. Journal of Symbolic Computation, 15:331\u2013348, Sept. 1993.","journal-title":"Journal of Symbolic Computation"},{"key":"14_CR18","unstructured":"E. Ohlebusch. Modular Properties of Composable Term Rewriting Systems. PhD thesis, Universit\u00e4t Bielefeld, 1994. Report 94-01."},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(94)00039-L","volume":"136","author":"E. Ohlebusch","year":"1994","unstructured":"E. Ohlebusch. On the modularity of termination of term rewriting systems. Theoretical Computer Science, 136:333\u2013360, 1994.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"14_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jsco.1995.1036","volume":"20","author":"E. Ohlebusch","year":"1995","unstructured":"E. Ohlebusch. Modular properties of composable term rewriting systems. Journal of Symbolic Computation, 20(1):1\u201342, 1995.","journal-title":"Journal of Symbolic Computation"},{"issue":"1","key":"14_CR21","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0747-7171(89)80022-7","volume":"8","author":"M. Schmidt-Schau\u00df","year":"1989","unstructured":"M. Schmidt-Schau\u00df. Unification in a combination of arbitrary disjoint equational theories. Journal of Symbolic Computation, 8(1):51\u201399, 1989.","journal-title":"Journal of Symbolic Computation"},{"issue":"2","key":"14_CR22","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/0304-3975(95)00080-G","volume":"149","author":"M. Schmidt-Schau\u00df","year":"1995","unstructured":"M. Schmidt-Schau\u00df, M. Marchiori, and S. Panitz. Modular termination of rconsistent and left-linear term rewriting systems. Theoretical Computer Science, 149(2):361\u2013374, 1995.","journal-title":"Theoretical Computer Science"},{"key":"14_CR23","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0020-0190(87)90122-0","volume":"25","author":"Y. Toyama","year":"1987","unstructured":"Y. Toyama. Counterexamples to termination for the direct sum of term rewriting systems. Information Processing Letters, 25:141\u2013143, 1987.","journal-title":"Information Processing Letters"},{"issue":"1","key":"14_CR24","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1145\/7531.7534","volume":"34","author":"Y. Toyama","year":"1987","unstructured":"Y. Toyama. On the Church-Rosser property for the direct sum of term rewriting systems. Journal of the ACM, 34(1):128\u2013143, 1987.","journal-title":"Journal of the ACM"},{"issue":"6","key":"14_CR25","doi-asserted-by":"crossref","first-page":"1275","DOI":"10.1145\/227683.227689","volume":"42","author":"Y. Toyama","year":"1995","unstructured":"Y. Toyama, J. Klop, and H. Barendregt. Termination for direct sums of left-linear complete term rewriting systems. Journal of the ACM, 42(6):1275\u20131304, 1995.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Recent Trends in Algebraic Development Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-64299-4_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:45:12Z","timestamp":1619574312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-64299-4_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540642992","9783540697190"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-64299-4_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}