{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:03:34Z","timestamp":1725516214518},"publisher-location":"Berlin, Heidelberg","reference-count":19,"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_12","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"172-186","source":"Crossref","is-referenced-by-count":3,"title":["On Normalisation of Infinitary Combinatory Reduction Systems"],"prefix":"10.1007","author":[{"given":"Jeroen","family":"Ketema","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"12_CR1","first-page":"18","volume":"119","author":"R. Kennaway","year":"1995","unstructured":"Kennaway, R., Klop, J.W., Sleep, R., de Vries, F.J.: Transfinite reductions in orthogonal term rewriting systems. I&C\u00a0119(1), 18\u201338 (1995)","journal-title":"I&C"},{"unstructured":"Kennaway, R., de Vries, F.J.: Infinitary rewriting. In: [19], ch.12","key":"12_CR2"},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0304-3975(96)00171-5","volume":"175","author":"J.R. Kennaway","year":"1997","unstructured":"Kennaway, J.R., Klop, J.W., Sleep, M.R., de Vries, F.J.: Infinitary lambda calculus. TCS\u00a0175(1), 93\u2013125 (1997)","journal-title":"TCS"},{"issue":"1&2","key":"12_CR4","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(93)90091-7","volume":"121","author":"J.W. Klop","year":"1993","unstructured":"Klop, J.W., van Oostrom, V., van Raamsdonk, F.: Combinatory reduction systems: introduction and survey. TCS\u00a0121(1&2), 279\u2013308 (1993)","journal-title":"TCS"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/978-3-540-32033-3_32","volume-title":"Term Rewriting and Applications","author":"J. Ketema","year":"2005","unstructured":"Ketema, J., Simonsen, J.G.: Infinitary combinatory reduction systems. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, pp. 438\u2013452. Springer, Heidelberg (2005)"},{"key":"12_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/11591191_15","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"J. Ketema","year":"2005","unstructured":"Ketema, J., Simonsen, J.G.: On confluence of infinitary combinatory reduction systems. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol.\u00a03835, pp. 199\u2013214. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Ketema, J., Simonsen, J.G.: Infinitary combinatory reduction systems. Technical Report D-558, Department of Computer Science, University of Copenhagen (2006)","key":"12_CR7","DOI":"10.1007\/978-3-540-32033-3_32"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/3-540-48685-2_5","volume-title":"Rewriting Techniques and Applications","author":"V. Oostrom van","year":"1999","unstructured":"van Oostrom, V.: Normalisation in weakly orthogonal rewriting. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol.\u00a01631, pp. 60\u201374. Springer, Heidelberg (1999)"},{"unstructured":"Klop, J.W., de Vrijer, R.: Infinitary normalization. In: We Will Show Them: Essays in Honour of Dov Gabbay, vol.\u00a02, pp. 169\u2013192. College Publications (2005)","key":"12_CR9"},{"key":"12_CR10","first-page":"395","volume-title":"Computational Logic: Essays in honor of Alan Robinson","author":"G. Huet","year":"1991","unstructured":"Huet, G., L\u00e9vy, J.J.: Computations in orthogonal rewriting systems. In: Computational Logic: Essays in honor of Alan Robinson, pp. 395\u2013443. MIT Press, Cambridge (1991)"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/3-540-60381-6_9","volume-title":"Conditional and Typed Rewriting Systems","author":"J. Glauert","year":"1995","unstructured":"Glauert, J., Khasidashvili, Z.: Relative normalization in orthogonal expression reduction systems. In: Lindenstrauss, N., Dershowitz, N. (eds.) CTRS 1994. LNCS, vol.\u00a0968, pp. 144\u2013165. Springer, Heidelberg (1995)"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/BFb0027014","volume-title":"Algebraic and Logic Programming","author":"Z. Khasidashvili","year":"1997","unstructured":"Khasidashvili, Z., Ogawa, M.: Perpetuality and uniform normalization. In: Hanus, M., Heering, J., Meinke, K. (eds.) ALP 1997 and HOA 1997. LNCS, vol.\u00a01298, pp. 240\u2013255. Springer, Heidelberg (1997)"},{"key":"12_CR13","first-page":"1","volume-title":"Handbook of Logic in Computer Science","author":"J.W. Klop","year":"1992","unstructured":"Klop, J.W.: Term rewriting systems. In: Handbook of Logic in Computer Science, vol.\u00a02, pp. 1\u2013116. Oxford University Press, Oxford (1992)"},{"unstructured":"Kennaway, R., van Oostrom, V., de Vries, F.J.: Meaningless terms in rewriting. The Journal of Functional and Logic Programming\u00a01 (1999)","key":"12_CR14"},{"issue":"4","key":"12_CR15","doi-asserted-by":"crossref","first-page":"445","DOI":"10.3233\/FI-1980-3405","volume":"3","author":"A. Arnold","year":"1980","unstructured":"Arnold, A., Nivat, M.: The metric space of infinite trees. Algebraic and topological properties. Fundamenta Informaticae\u00a03(4), 445\u2013476 (1980)","journal-title":"Fundamenta Informaticae"},{"unstructured":"Klop, J.W., van Oostrom, V., de Vrijer, R.: Orthogonality. In: [19], ch.\u00a04","key":"12_CR16"},{"doi-asserted-by":"crossref","unstructured":"Middeldorp, A.: Call by need computations to root-stable form. In: POPL 1997, pp. 94\u2013105 (1997)","key":"12_CR17","DOI":"10.1145\/263699.263711"},{"unstructured":"van Raamsdonk, F.: Confluence and Normalisation for Higher-Order Rewriting. PhD thesis, Vrije Universiteit, Amsterdam (1996)","key":"12_CR18"},{"key":"12_CR19","series-title":"Cambridge Tracts in Theorectical Computer Science","volume-title":"Term Rewriting Systems","year":"2003","unstructured":"Terese (ed.): Term Rewriting Systems. Cambridge Tracts in Theorectical Computer Science, vol.\u00a055. 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_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T18:19:01Z","timestamp":1631643541000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70590-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705888","9783540705901"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70590-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}