{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:04:08Z","timestamp":1725566648442},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540255963"},{"type":"electronic","value":"9783540320333"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-32033-3_5","type":"book-chapter","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T00:20:02Z","timestamp":1285633202000},"page":"46-60","source":"Crossref","is-referenced-by-count":0,"title":["Abstract Modularity"],"prefix":"10.1007","author":[{"given":"Michael","family":"Abbott","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neil","family":"Ghani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoph","family":"L\u00fcth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","series-title":"London Mathematical Society Lecture Note Series","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511600579","volume-title":"Locally Presentable and Accessible Categories","author":"J. Ad\u00e1mek","year":"1994","unstructured":"Ad\u00e1mek, J., Rosick\u00fd, J.: Paragon. London Mathematical Society Lecture Note Series, vol.\u00a0189. Cambridge University Press, Cambridge (1994)"},{"key":"5_CR2","volume-title":"Grundlehren der mathematischen Wissenschaften","author":"M. Barr","year":"1985","unstructured":"Barr, M., Wells, C.: Toposes, Triples and Theories. In: Grundlehren der mathematischen Wissenschaften, vol.\u00a0278, Springer, Heidelberg (1985)"},{"key":"5_CR3","first-page":"290","volume":"10","author":"N. Ghani","year":"2004","unstructured":"Ghani, N., L\u00fcth, C.: Rewriting via coinserters. Nordic Journal of Computing\u00a010, 290\u2013312 (2004)","journal-title":"Nordic Journal of Computing"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1051\/ita:2003021","volume":"37","author":"N. Ghani","year":"2003","unstructured":"Ghani, N., L\u00fcth, C., de Marchi, F.: Solving algebraic equations using coalgebra. Journal of Theoretical Informatics and Applications\u00a037, 301\u2013314 (2003)","journal-title":"Journal of Theoretical Informatics and Applications"},{"key":"5_CR5","unstructured":"Ghani, N., L\u00fcth, C., de Marchi, F.: Monads of coalgebras: Rational terms and term graphs. To appear in Mathematical Structures in Computer Science"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/976571.976580","volume-title":"Proc. of 2nd ACM SIGPLAN Wksh. on Mechanized Reasoning about Languages with Variable Binding, MERLIN 2003","author":"N. Ghani","year":"2003","unstructured":"Ghani, N., Uustalu, T.: Explicit substitutions and higher-order syntax (extended abstract). In: Honsell, F., Miculan, M., Momigliano, A. (eds.) Proc. of 2nd ACM SIGPLAN Wksh. on Mechanized Reasoning about Languages with Variable Binding, MERLIN 2003, pp. 1\u20137. ACM Press, New York (2003)"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1051\/ita:2004016","volume":"38","author":"N. Ghani","year":"2004","unstructured":"Ghani, N., Uustalu, T.: Coproducts of ideal monads. Journal of Theoretical Informatics and Applications\u00a038, 321\u2013342 (2004)","journal-title":"Journal of Theoretical Informatics and Applications"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1145\/888251.888266","volume-title":"Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming","author":"M. Hamana","year":"2003","unstructured":"Hamana, M.: Term rewriting with variable binding: an initial algebra approach. In: Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming, pp. 148\u2013159. ACM Press, New York (2003)"},{"key":"5_CR9","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.: A simplified proof of Toyama\u2019s theorem. Information Processing Letters\u00a049, 101\u2013109 (1994)","journal-title":"Information Processing Letters"},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(90)90221-I","volume":"34","author":"M. Kurihara","year":"1990","unstructured":"Kurihara, M., Kaji, I.: Modular term rewriting systems and the termination. Information Processing Letters\u00a034(1), 1\u20134 (1990)","journal-title":"Information Processing Letters"},{"key":"5_CR11","unstructured":"L\u00fcth, C.: Categorical Term Rewriting: Monads and Modularity. PhD thesis, University of Edinburgh (1998)"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/BFb0026982","volume-title":"Category Theory and Computer Science","author":"C. L\u00fcth","year":"1997","unstructured":"L\u00fcth, C., Ghani, N.: Monads and modular term rewriting. In: Moggi, E., Rosolini, G. (eds.) CTCS 1997. LNCS, vol.\u00a01290, pp. 69\u201386. Springer, Heidelberg (1997)"},{"key":"5_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-45988-X_3","volume-title":"Frontiers of Combining Systems","author":"C. L\u00fcth","year":"2002","unstructured":"L\u00fcth, C., Ghani, N.: Monads and modularity. In: Armando, A. (ed.) FroCos 2002. LNCS (LNAI), vol.\u00a02309, pp. 18\u201332. Springer, Heidelberg (2002)"},{"key":"5_CR14","series-title":"Graduate Texts in Mathematics","volume-title":"Categories for the Working Mathematician","author":"S. MacLane","year":"1971","unstructured":"MacLane, S.: Categories for the Working Mathematician. Graduate Texts in Mathematics, vol.\u00a05. Springer, Heidelberg (1971)"},{"key":"5_CR15","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-9860-1","volume-title":"Algebraic Theories","author":"E.G. Manes","year":"1976","unstructured":"Manes, E.G.: Algebraic Theories. Graduate Texts in Mathematics. Springer, Heidelberg (1976)"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/3-540-59200-8_43","volume-title":"Rewriting Techniques and Applications","author":"M. Marchiori","year":"1995","unstructured":"Marchiori, M.: Modularity of completeness revisited. In: Hsiang, J. (ed.) RTA 1995. LNCS, vol.\u00a0914, pp. 2\u201310. Springer, Heidelberg (1995)"},{"key":"5_CR17","unstructured":"Middeldorp, A.: Modular Properties of Term Rewriting Systems. PhD thesis, Vrije Universiteit te Amsterdam (1990)"},{"key":"5_CR18","unstructured":"Middeldorp, A., Toyama, Y.: Completeness of constructor systems. Technical Report CS-R9058, Centrum voor Wiskunde en Informatica, Amsterdam (1990)"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(94)00039-L","volume":"136","author":"E. Ohlebusch","year":"1994","unstructured":"Ohlebusch, E.: On the modularity of termination of term rewriting systems. Theoretical Computer Science\u00a0136, 333\u2013360 (1994)","journal-title":"Theoretical Computer Science"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","volume-title":"Trees in Algebra and Programming - CAAP \u201994","author":"E. Ohlenbusch","year":"1994","unstructured":"Ohlenbusch, E.: On the modularity of confluence of constructor-sharing term rewriting systems. In: Tison, S. (ed.) CAAP 1994. LNCS, vol.\u00a0787, Springer, Heidelberg (1994)"},{"key":"5_CR21","unstructured":"Robinson, E.: Variations on algebra: monadicity and generalisations of equational theories. Manuscript. Available at (1994), \n                  \n                    http:\/\/www.dcs.qmw.ac.uk\/~edmundr\/pubs\/algebras\/algebras.ps"},{"issue":"2","key":"5_CR22","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0020-0190(87)90039-1","volume":"26","author":"M. Rusinowitch","year":"1987","unstructured":"Rusinowitch, M.: On the termination of the direct sum of term-rewriting systems. Information Processing Letters\u00a026(2), 65\u201370 (1987)","journal-title":"Information Processing Letters"},{"issue":"1","key":"5_CR23","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"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-32033-3_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:45:37Z","timestamp":1620013537000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-32033-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540255963","9783540320333"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-32033-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}