{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T02:34:51Z","timestamp":1794364491121,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642023477","type":"print"},{"value":"9783642023484","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02348-4_17","type":"book-chapter","created":{"date-parts":[[2009,6,18]],"date-time":"2009-06-18T03:27:21Z","timestamp":1245295641000},"page":"239-254","source":"Crossref","is-referenced-by-count":1,"title":["Comparing B\u00f6hm-Like Trees"],"prefix":"10.1007","author":[{"given":"Jeroen","family":"Ketema","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Ketema, J.: B\u00f6hm-Like Trees for Rewriting. PhD thesis, Vrije Universiteit, Amsterdam (2001)"},{"key":"17_CR2","unstructured":"L\u00e9vy, J.J.: R\u00e9ductions correctes et optimales dans le lambda-calcul. PhD thesis, Universit\u00e9 de Paris VII (1978)"},{"key":"17_CR3","volume-title":"The Lambda Calculus: Its Syntax and Semantics","author":"H.P. Barendregt","year":"1985","unstructured":"Barendregt, H.P.: The Lambda Calculus: Its Syntax and Semantics, revised edn. Elsevier Science, Amsterdam (1985)"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BFb0029523","volume-title":"Lambda-Calculus and Computer Science Theory","author":"J.J. L\u00e9vy","year":"1975","unstructured":"L\u00e9vy, J.J.: An algebraic interpretation of the $\\lambda \\beta \\textrm{K}$ -calculus and the labelled \u03bb-calculus. In: B\u00f6hm, C. (ed.) Lambda-Calculus and Computer Science Theory. LNCS, vol.\u00a037, pp. 147\u2013165. Springer, Heidelberg (1975)"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0168-0072(83)90030-1","volume":"24","author":"G. Longo","year":"1983","unstructured":"Longo, G.: Set-theoretical models of \u03bb-calculus: Theories, expansions, isomorphisms. Annals of Pure and Applied Logic\u00a024, 153\u2013188 (1983)","journal-title":"Annals of Pure and Applied Logic"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Berarducci, A.: Infinite \u03bb-calculus and non-sensible models. In: Logic and Algebra. Lect. Notes Pure Appl. Math., vol.\u00a0180, pp. 339\u2013378 (1996)","DOI":"10.1201\/9780203748671-17"},{"key":"17_CR7","unstructured":"Kennaway, R., van Oostrom, V., de Vries, F.J.: Meaningless terms in rewriting. JFLP\u00a01 (1999)"},{"key":"17_CR8","unstructured":"Kennaway, R., del Vries, F.-J.: Infinitary rewriting. In: [18], ch.\u00a012"},{"key":"17_CR9","unstructured":"Blom, S.C.C.: Term Graph Rewriting: syntax and semantics. PhD thesis, Vrije Universiteit, Amsterdam (2001)"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-540-25979-4_17","volume-title":"Rewriting Techniques and Applications","author":"J. Ketema","year":"2004","unstructured":"Ketema, J.: B\u00f6hm-like trees for term rewriting systems. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 233\u2013248. Springer, Heidelberg (2004)"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"17_CR12","series-title":"Lecture Notes in Computer Science","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)"},{"key":"17_CR13","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)","DOI":"10.1007\/978-3-540-32033-3_32"},{"issue":"1-2","key":"17_CR14","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":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-540-70590-1_12","volume-title":"Rewriting Techniques and Applications","author":"J. Ketema","year":"2008","unstructured":"Ketema, J.: On normalisation of infinitary combinatory reduction systems. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol.\u00a05117, pp. 172\u2013186. Springer, Heidelberg (2008)"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/11601548_11","volume-title":"Processes, Terms and Cycles: Steps on the Road to Infinity","author":"R. Kennaway","year":"2005","unstructured":"Kennaway, R., et al.: 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. LNCS, vol.\u00a03838, pp. 148\u2013172. Springer, Heidelberg (2005)"},{"issue":"1","key":"17_CR17","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., et al.: Infinitary lambda calculus. TCS\u00a0175(1), 93\u2013125 (1997)","journal-title":"TCS"},{"key":"17_CR18","volume-title":"Term Rewriting Systems","year":"2003","unstructured":"Terese (ed.): Term Rewriting Systems. Cambridge University Press, Cambridge (2003)"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02348-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T19:53:40Z","timestamp":1558382020000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02348-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642023477","9783642023484"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02348-4_17","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-02348-4","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}