{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:03:45Z","timestamp":1725516225849},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705888"},{"type":"electronic","value":"9783540705901"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70590-1_30","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"441-455","source":"Crossref","is-referenced-by-count":7,"title":["Normalization of Infinite Terms"],"prefix":"10.1007","author":[{"given":"Hans","family":"Zantema","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0304-3975(99)00207-8","volume":"236","author":"T. Arts","year":"2000","unstructured":"Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science\u00a0236, 133\u2013178 (2000)","journal-title":"Theoretical Computer Science"},{"key":"30_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1007\/11814771_47","volume-title":"Automated Reasoning","author":"J. Endrullis","year":"2006","unstructured":"Endrullis, J., Waldmann, J., Zantema, H.: Matrix interpretations for proving termination of term rewriting. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol.\u00a04130, pp. 574\u2013588. Springer, Heidelberg (2006)"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Endrullis, J., Waldmann, J., Zantema, H.: Matrix interpretations for proving termination of term rewriting. Journal of Automated Reasoning (to appear, 2008)","DOI":"10.1007\/s10817-007-9087-9"},{"key":"30_CR4","unstructured":"Giesl, J., et al.: Automated program verification environment (AProVE), \n                  \n                    http:\/\/aprove.informatik.rwth-aachen.de\/"},{"key":"30_CR5","unstructured":"Kennaway, J.R.: On transfinite abstract reduction systems. Computer Science Reports CS-R9205. CWI Amsterdam (1992)"},{"key":"30_CR6","first-page":"668","volume-title":"Term Rewriting Systems, by Terese","author":"R. Kennaway","year":"2003","unstructured":"Kennaway, R., de Vries, F.-J.: Infinitary rewriting. In: Term Rewriting Systems, by Terese, pp. 668\u2013711. Cambridge University Press, Cambridge (2003)"},{"issue":"1","key":"30_CR7","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1006\/inco.1995.1075","volume":"119","author":"R. Kennaway","year":"1995","unstructured":"Kennaway, R., Klop, J.W., Sleep, M.R., de Vries, F.-J.: Transfinite reductions in orthogonal term rewriting systems. Information and Computation\u00a0119(1), 18\u201338 (1995)","journal-title":"Information and Computation"},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/11601548_11","volume-title":"Processes, Terms and Cycles: Steps on the Road to Infinity:Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday","author":"R. Kennaway","year":"2005","unstructured":"Kennaway, R., Severi, P., Sleep, R., de Vries, F.-J.: Infinitary rewriting: From syntax to semantics. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity: Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday. LNCS, vol.\u00a03838, pp. 148\u2013172. Springer, Heidelberg (2005)"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of the 19th Conference on Rewriting Techniques and Applications (RTA)","author":"J. Ketema","year":"2008","unstructured":"Ketema, J.: On normalisation of infinitary combinatory reduction systems. In: Voronkov, A. (ed.) Proceedings of the 19th Conference on Rewriting Techniques and Applications (RTA). LNCS. Springer, Heidelberg (2008)"},{"key":"30_CR10","unstructured":"Klop, J.W., de Vrijer, R.C.: Infinitary normalization. In: We Will Show Them! Essays in Honour of Dov Gabbay, vol.\u00a02, pp. 169\u2013192. College Publications (2005)"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1006\/jsco.1994.1003","volume":"17","author":"H. Zantema","year":"1994","unstructured":"Zantema, H.: Termination of term rewriting: Interpretation and type elimination. Journal of Symbolic Computation\u00a017, 23\u201350 (1994)","journal-title":"Journal of Symbolic Computation"},{"key":"30_CR12","first-page":"181","volume-title":"Term Rewriting Systems, by Terese","author":"H. Zantema","year":"2003","unstructured":"Zantema, H.: Termination. In: Term Rewriting Systems, by Terese, pp. 181\u2013259. Cambridge University Press, Cambridge (2003)"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70590-1_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:23:55Z","timestamp":1620015835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70590-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705888","9783540705901"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70590-1_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}