{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:19Z","timestamp":1761611299641},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540566106"},{"type":"electronic","value":"9783540475989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56610-4_83","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T06:21:53Z","timestamp":1330237313000},"page":"468-484","source":"Crossref","is-referenced-by-count":16,"title":["Term rewriting in CT\u03a3"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Corradini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"issue":"1","key":"32_CR1","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/321992.321997","volume":"24","author":"J. A. Goguen","year":"1977","unstructured":"J.A. Goguen, J.W. Tatcher, E.G. Wagner, J.R. Wright, Initial Algebra Semantics and Continuous Algebras, JACM 24 (1), 1977, pp. 68\u201395.","journal-title":"JACM"},{"key":"32_CR2","doi-asserted-by":"crossref","first-page":"445","DOI":"10.3233\/FI-1980-3405","volume":"4","author":"A. Arnold","year":"1980","unstructured":"A. Arnold, M. Nivat, The metric space of infinite trees. Algebraic and topological properties, Fundamenta Informatica, 4, 1980, pp. 445\u2013476.","journal-title":"Fundamenta Informatica"},{"key":"32_CR3","first-page":"141","volume":"259","author":"H. P. Barendregt","year":"1987","unstructured":"H.P. Barendregt, M.C.J.D. van Eekelen, J.R.W, Glauert, J.R. Kennaway, M.J. Plasmeijer, M.R. Sleep, Term graph reduction, in Proc. PARLE, LNCS 259, 1987, pp. 141\u2013158.","journal-title":"Proc. PARLE, LNCS"},{"key":"32_CR4","unstructured":"A. Corradini, F. Rossi, Hyperedge Replacement Jungle Rewriting for Term Rewriting Systems and Logic Programming, to appear in Theoretical Computer Science."},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"N. Dershowitz, J.-P. Jouannaud, Rewrite Systems, Handbook of Theoretical Computer Science (ed. J. van Leeuwen), Vol. B, North Holland, 1990, pp. 243\u2013320.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"N. Dershowitz, S. Kaplan, Rewrite, Rewrite, Rewrite, Rewrite, Rewrite ..., Principles of Programming Languages, Austin 1989, pp. 250\u2013259.","DOI":"10.1145\/75277.75299"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"N. Dershowitz, S. Kaplan, D.A. Plaisted, Infinite Normal Forms (plus corrigendum), ICALP 1989, pp. 249\u2013262.","DOI":"10.1007\/BFb0035765"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"H. Ehrig, M. Pfender, H.J. Schneider, Graph-grammars: an algebraic approach, Proc, IEEE Conf. on Automata and Switching Theory, 1973, pp. 167\u2013180.","DOI":"10.1109\/SWAT.1973.11"},{"key":"32_CR9","volume-title":"Report M88-53","author":"W. M. Farmer","year":"1988","unstructured":"W.M. Farmer, J.D. Ramsdell, R.J. Watro, A correcteness proof for combinator reduction with cycles. Report M88-53, The MITRE Corporation, Massachussets, 1988."},{"key":"32_CR10","volume-title":"Computing with the Curry Chip, Report M89-59","author":"W. M. Farmer","year":"1989","unstructured":"W.M. Farmer, R.J. Watro, Redex capturing in term graph rewriting, in Computing with the Curry Chip, Report M89-59, The MITRE Corporation, Massachussets, 1989."},{"issue":"5","key":"32_CR11","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1051\/ita\/1991250504451","volume":"25","author":"B. Hoffmann","year":"1991","unstructured":"B. Hoffmann, D. Plump, Implementing Term Rewriting by Jungle Evaluation, in Informatique th\u00e9orique et Applications\/Theoretical Informatics and Applications, 25 (5), 1991, pp. 445\u2013472.","journal-title":"Informatique th\u00e9orique et Applications\/Theoretical Informatics and Applications"},{"issue":"4","key":"32_CR12","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, in Journal of the ACM, 27 (4), 1980, pp. 797\u2013821.","journal-title":"Journal of the ACM"},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0304-3975(87)90079-X","volume":"52","author":"J. R. Kennaway","year":"1987","unstructured":"J.R. Kennaway, On \u2018On Graph Rewritings', Theoretical Computer Science, 52, 1987, pp. 37\u201358.","journal-title":"Theoretical Computer Science"},{"key":"32_CR14","volume-title":"Report CS-R9041","author":"J. R. Kennaway","year":"1990","unstructured":"J.R, Kennaway, J.W. Klop, M.R. Sleep, F.J. De Vries, Transfinite Reductions in Orthogonal Term Rewriting System, Report CS-R9041, Centre for Mathematics and Computer Science, The Netherland, 1990."},{"key":"32_CR15","unstructured":"J.W. Klop, Term rewriting systems, to appear in Handbook of Logic in Computer Science (eds. S. Abramsky, D. Gabbay, and T. Maibaum), Vol I, Oxford University Press, 1991."},{"key":"32_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(84)90021-5","volume":"32","author":"J. C. Raoult","year":"1984","unstructured":"J.C. Raoult, On Graph Rewritings, Theoretical Computer Science, 32, 1984, pp. 1\u201324.","journal-title":"Theoretical Computer Science"},{"key":"32_CR17","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 maninulating systems and Church-Rosser theorems, JACM 20, 1973, pp. 160\u2013187.","journal-title":"JACM"}],"container-title":["Lecture Notes in Computer Science","TAPSOFT'93: Theory and Practice of Software Development"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56610-4_83.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T23:53:04Z","timestamp":1640908384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56610-4_83"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540566106","9783540475989"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-56610-4_83","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}