{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:55Z","timestamp":1761611215048},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540421177"},{"type":"electronic","value":"9783540451273"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45127-7_17","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:25:25Z","timestamp":1184588725000},"page":"216-230","source":"Crossref","is-referenced-by-count":8,"title":["Transfinite Rewriting Semantics for Term Rewriting Systems"],"prefix":"10.1007","author":[{"given":"Salvador","family":"Lucas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,5,8]]},"reference":[{"key":"17_CR1","unstructured":"M. Alpuente, S. Escobar, and S. Lucas. Redundancy Analyses in Term Rewriting. In Proc of WFLP\u20192000, pages 309\u2013323, 2000."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.","DOI":"10.1017\/CBO9781139172752"},{"key":"17_CR3","first-page":"169","volume-title":"Algebraic Methods in Semantics","author":"G. Boudol","year":"1985","unstructured":"G. Boudol. Computational semantics of term rewriting systems. In M. Nivat and J. Reynolds, editors, Algebraic Methods in Semantics, pages 169\u2013236, Cambridge University Press, Cambridge, 1985."},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","volume":"25","author":"B. Courcelle","year":"1983","unstructured":"B. Courcelle. Fundamental Properties of Infinite Trees. Theoretical Computer Science 25:95\u2013169, 1983.","journal-title":"Theoretical Computer Science"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"B. Courcelle. Recursive Applicative Program Schemes. In Handbook of Theoretical Computer Science, pages 459\u2013492, Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50014-7"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0304-3975(91)90040-9","volume":"83","author":"N. Dershowitz","year":"1991","unstructured":"N. Dershowitz, S. Kaplan, and D. Plaisted. Rewrite, rewrite, rewrite, rewrite, rewrite. Theoretical Computer Science 83:71\u201396, 1991.","journal-title":"Theoretical Computer Science"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"I. Durand and A. Middeldorp. Decidable Call by Need Computations in Term Rewriting (Extended Abstract). In Proc. of CADE\u201997, LNAI 1249:4\u201318, 1997.","DOI":"10.1007\/3-540-63104-6_2"},{"key":"17_CR8","unstructured":"M. Hanus and S. Lucas. An Evaluation Semantics for Narrowing-Based Functional Logic Languages. Journal of Functional and Logic Programming, to appear, 2001."},{"key":"17_CR9","first-page":"395","volume-title":"Computational logic: essays in honour of J. Alan Robinson","author":"G. Huet","year":"1991","unstructured":"G. Huet and J.J. L\u00e9vy. Computations in orthogonal term rewriting systems. In Computational logic: essays in honour of J. Alan Robinson, pages 395\u2013414 and 415\u2013443. The MIT Press, Cambridge, MA, 1991."},{"key":"17_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1007\/3-540-61464-8_65","volume-title":"Proc. of RTA\u201996","author":"F. Jacquemard","year":"1996","unstructured":"F. Jacquemard. Decidable approximations to Term Rewriting Systems. In Proc. of RTA\u201996, LNCS 1103:362\u2013376, 1996."},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1006\/inco.1995.1075","volume":"119","author":"R. Kennaway","year":"1995","unstructured":"R. Kennaway, J.W. Klop, M.R. Sleep, and F.-J. de Vries. Transfinite reductions in Orthogonal Term Rewriting Systems. Information and Computation 119(1):18\u201338, 1995.","journal-title":"Information and Computation"},{"key":"17_CR12","volume-title":"Technical Report LIX\/RR\/00\/02","author":"S. Lucas","year":"2000","unstructured":"S. Lucas. Observable Semantics and Dynamic Analysis of Computational Processes. Technical Report LIX\/RR\/00\/02, \u00c9cole Polytechnique, Palaiseau, France, 2000."},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"A. Middeldorp. Call by Need Computations to Root-Stable Form. In Proc. of POPL\u201997, pages 94\u2013105, ACM Press, 1997.","DOI":"10.1145\/263699.263711"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"A. Pitts. Operationally-Based Theories of Program Equivalence. In Semantics and Logics of Computation, pages 241\u2013298, Cambridge University Press, 1997.","DOI":"10.1017\/CBO9780511526619.007"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45127-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:36:02Z","timestamp":1556667362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45127-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540421177","9783540451273"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45127-7_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}