{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:43:31Z","timestamp":1725565411565},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221531"},{"type":"electronic","value":"9783540259794"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25979-4_16","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T01:32:53Z","timestamp":1284168773000},"page":"221-232","source":"Crossref","is-referenced-by-count":2,"title":["An Approximation Based Approach to Infinitary Lambda Calculi"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Blom","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"16_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1023\/A:1010654904735","volume":"27","author":"M. Bognar","year":"2001","unstructured":"Bognar, M., de Vrijer, R.: A calculus of lambda calculus contexts. Journal of Automated Reasoning\u00a027(1), 29\u201359 (2001)","journal-title":"Journal of Automated Reasoning"},{"key":"16_CR2","unstructured":"Berarducci, A.: Infinite \u03bb-calculus and non-sensible \u03bb-models. In: Proceedings of the conference in honour of Roberto Magari, Marcel & Decker, New York. To appear in the series on Logic and Algebra (1994)"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1007\/3-540-56610-4_83","volume-title":"TAPSOFT \u201993: Theory and Practice of Software Development","author":"A. Corradini","year":"1993","unstructured":"Corradini, A.: Term rewriting in CT\u03a3. In: Gaudel, M.-C., Jouannaud, J.-P. (eds.) CAAP 1993, FASE 1993, and TAPSOFT 1993. LNCS, vol.\u00a0668, pp. 468\u2013484. Springer, Heidelberg (1993)"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Dershowitz, N., Kaplan, S.: Rewrite, rewrite, rewrite, rewrite, rewrite. In: Proc. ACM Conference on Principles of Programming Languages, Austin, Texas, pp. 250\u2013259 (1989)","DOI":"10.1145\/75277.75299"},{"key":"16_CR5","series-title":"Cambridge Tracts in Theoretical Computer Science","first-page":"668","volume-title":"Term Rewriting Systems","author":"R. Kennaway","year":"2003","unstructured":"Kennaway, R., de Vries, F.: Infinitary rewriting. In: Bezem, M., Klop, J.W., de Vrijer, R. (eds.) Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol.\u00a055, ch. 12, pp. 668\u2013711. Cambridge university press, Cambridge (2003)"},{"key":"16_CR6","unstructured":"Kennaway, J.R.: On transfinite abstract reduction systems. Technical Report CS-R9205, CWI (1992)"},{"key":"16_CR7","first-page":"47","volume-title":"Term Graph Rewriting: Theory and Practice","author":"J.R. Kennaway","year":"1993","unstructured":"Kennaway, J.R., Klop, J.W., Sleep, M.R., de Vries, F.J.: An infinitary church-rosser property for non-collapsing orthogonal term rewriting systems. In: Sleep, M.R., Plasmeijer, M.J., van Eekelen, M.C.D.J. (eds.) Term Graph Rewriting: Theory and Practice, pp. 47\u201359. John Wiley & Sons, Chichester (1993)"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/3-540-59200-8_62","volume-title":"Rewriting Techniques and Applications","author":"J.R. Kennaway","year":"1995","unstructured":"Kennaway, J.R., Klop, J.W., Sleep, M.R., de Vries, F.J.: Infinitary lambda calculus and bohm models. In: Hsiang, J. (ed.) RTA 1995. LNCS, vol.\u00a0914, pp. 257\u2013270. Springer, Heidelberg (1995)"},{"issue":"1","key":"16_CR9","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1006\/inco.1995.1075","volume":"119","author":"J.R. Kennaway","year":"1995","unstructured":"Kennaway, J.R., Klop, J.W., Sleep, M.R., de Vries, F.J.: Transfinite reduction in orthogonal term rewriting systems. Information and Computation\u00a0119(1), 18\u201338 (1995)","journal-title":"Information and Computation"},{"key":"16_CR10","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, 93\u2013125 (1997)","journal-title":"TCS"},{"key":"16_CR11","unstructured":"L\u00e9vy, J.-J.: R\u00e9ductions Correctes et Optimales dans le Lambda-Calcul. PhD thesis, Universite Paris VII (October 1978)"}],"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-540-25979-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T10:03:46Z","timestamp":1553076226000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25979-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221531","9783540259794"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25979-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}