{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T18:32:04Z","timestamp":1693852324843},"reference-count":52,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T00:00:00Z","timestamp":1452124800000},"content-version":"vor","delay-in-days":1681,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1016\/j.ic.2011.01.007","type":"journal-article","created":{"date-parts":[[2011,2,5]],"date-time":"2011-02-05T09:23:23Z","timestamp":1296897803000},"page":"893-926","source":"Crossref","is-referenced-by-count":6,"title":["Infinitary Combinatory Reduction Systems"],"prefix":"10.1016","volume":"209","author":[{"given":"Jeroen","family":"Ketema","sequence":"first","affiliation":[]},{"given":"Jakob Grue","family":"Simonsen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ic.2011.01.007_b0005","series-title":"Proceedings of the 16th International Conference on Rewriting Techniques and Applications (RTA 2005)","first-page":"438","article-title":"Infinitary combinatory reduction systems","volume":"vol. 3467","author":"Ketema","year":"2005"},{"key":"10.1016\/j.ic.2011.01.007_b0010","series-title":"Proceedings of the 12th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2005)","first-page":"199","article-title":"On confluence of infinitary combinatory reduction systems","volume":"vol. 3835","author":"Ketema","year":"2005"},{"issue":"1:7","key":"10.1016\/j.ic.2011.01.007_b0015","first-page":"1","article-title":"Infinitary combinatory reduction systems: normalising reduction strategies","volume":"6","author":"Ketema","year":"2010","journal-title":"Logical Methods in Computer Science"},{"issue":"4:3","key":"10.1016\/j.ic.2011.01.007_b0020","first-page":"1","article-title":"Infinitary combinatory reduction systems: confluence","volume":"5","author":"Ketema","year":"2009","journal-title":"Logical Methods in Computer Science"},{"key":"10.1016\/j.ic.2011.01.007_b0025","series-title":"Modern Programming Languages: A Practical Introduction","author":"Webber","year":"2003"},{"key":"10.1016\/j.ic.2011.01.007_b0030","series-title":"Proceedings of the Third ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL\u201976)","first-page":"95","article-title":"A lazy evaluator","author":"Henderson","year":"1976"},{"issue":"1","key":"10.1016\/j.ic.2011.01.007_b0035","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0304-3975(91)90040-9","article-title":"Rewrite, rewrite, rewrite, rewrite, rewrite,\u2026","volume":"83","author":"Dershowitz","year":"1991","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"10.1016\/j.ic.2011.01.007_b0040","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1006\/inco.1995.1075","article-title":"Transfinite reductions in orthogonal term rewriting systems","volume":"119","author":"Kennaway","year":"1995","journal-title":"Information and Computation"},{"issue":"1","key":"10.1016\/j.ic.2011.01.007_b0045","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/S0304-3975(96)00171-5","article-title":"Infinitary lambda calculus","volume":"175","author":"Kennaway","year":"1997","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.ic.2011.01.007_b0050","unstructured":"R. Kennaway, F.-J. de Vries, Infinitary rewriting, in: Terese [16], pp. 668\u2013711 (Chapter 12)."},{"key":"10.1016\/j.ic.2011.01.007_b0055","series-title":"Functional Programming and Parallel Graph Rewriting","author":"Plasmeijer","year":"1993"},{"key":"10.1016\/j.ic.2011.01.007_b0060","unstructured":"E. Barendsen, Term graph rewriting, in: Terese [16], pp. 712\u2013743 (Chapter 13)."},{"key":"10.1016\/j.ic.2011.01.007_b0065","first-page":"717","article-title":"Definitional interpreters for higher-order programming languages","volume":"vol. 2","author":"Reynolds","year":"1972"},{"key":"10.1016\/j.ic.2011.01.007_b0070","series-title":"Proceedings of the Third ACM SIGPLAN International Conference on Principles and Practices of Declarative Programming (PPDP\u201901)","first-page":"162","article-title":"Defunctionalization at work","author":"Danvy","year":"2001"},{"key":"10.1016\/j.ic.2011.01.007_b0075","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.tcs.2006.12.030","article-title":"Flow analysis of lazy higher-order functional programs","volume":"375","author":"Andersen","year":"2007","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.ic.2011.01.007_b0080","series-title":"Term Rewriting Systems","volume":"vol. 55","year":"2003"},{"key":"10.1016\/j.ic.2011.01.007_b0085","series-title":"The Lambda Calculus: Its Syntax and Semantics","author":"Barendregt","year":"1985"},{"key":"10.1016\/j.ic.2011.01.007_b0090","unstructured":"P. Aczel, A general Church\u2013Rosser theorem, Tech. Rep., University of Manchester, 1978."},{"key":"10.1016\/j.ic.2011.01.007_b0095","unstructured":"J.W. Klop, Combinatory reduction systems, Ph.D. Thesis, Rijksuniversiteit Utrecht, 1980."},{"issue":"1 and 2","key":"10.1016\/j.ic.2011.01.007_b0100","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(93)90091-7","article-title":"Combinatory reduction systems: introduction and survey","volume":"121","author":"Klop","year":"1993","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.ic.2011.01.007_b0105","first-page":"399","article-title":"Higher-order rewriting and equational reasoning","volume":"vol. 1","author":"Nipkow","year":"1998"},{"key":"10.1016\/j.ic.2011.01.007_b0110","doi-asserted-by":"crossref","unstructured":"F. van Raamsdonk, Higher-order rewriting, in: Terese [16], pp. 588\u2013667 (Chapter 11).","DOI":"10.1007\/3-540-48685-2_17"},{"key":"10.1016\/j.ic.2011.01.007_b0115","series-title":"Processes, Terms and Cycles: Steps on the Road to Infinity","first-page":"496","article-title":"Expression reduction systems and extensions: An overview","volume":"vol. 3838","author":"Glauert","year":"2005"},{"key":"10.1016\/j.ic.2011.01.007_b0120","series-title":"Proceedings of the 12th International Conference on Rewriting Techniques and Applications (RTA 2001)","first-page":"338","article-title":"Confluence and termination of simply typed term rewriting systems","volume":"vol. 2051","author":"Yamada","year":"2001"},{"key":"10.1016\/j.ic.2011.01.007_b0125","unstructured":"V. van Oostrom, Confluence for abstract and higher-order rewriting, Ph.D. Thesis, Vrije Universiteit Amsterdam, 1994."},{"key":"10.1016\/j.ic.2011.01.007_b0130","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0304-3975(97)00143-6","article-title":"Higher-order rewrite systems and their confluence","volume":"192","author":"Mayr","year":"1998","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.ic.2011.01.007_b0135","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.entcs.2005.01.034","article-title":"A rewriting calculus for higher-order term graphs","volume":"127","author":"Bertolissi","year":"2005","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"10.1016\/j.ic.2011.01.007_b0140","series-title":"Logic and Algebra","first-page":"339","article-title":"Infinite \u03bb-calculus and non-sensible models","volume":"vol. 180","author":"Berarducci","year":"1996"},{"key":"10.1016\/j.ic.2011.01.007_b0145","series-title":"Proceedings of the Seventh International Conference on Rewriting Techniques and Applications (RTA\u201996)","first-page":"138","article-title":"Higher-order narrowing with definitional trees","volume":"vol. 1103","author":"Hanus","year":"1996"},{"key":"10.1016\/j.ic.2011.01.007_b0150","series-title":"Proceedings of the Seventh International Conference on Rewriting Techniques and Applications (RTA\u201996)","first-page":"392","article-title":"Higher-order families","volume":"vol. 1103","author":"van Oostrom","year":"1996"},{"issue":"4","key":"10.1016\/j.ic.2011.01.007_b0155","doi-asserted-by":"crossref","first-page":"445","DOI":"10.3233\/FI-1980-3405","article-title":"The metric space of infinite trees. Algebraic and topological properties","volume":"3","author":"Arnold","year":"1980","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/j.ic.2011.01.007_b0160","series-title":"Proceedings of the 16th Annual ACM Symposium on Principles of Programming Languages (POPL\u201989)","first-page":"250","article-title":"Rewrite, rewrite, rewrite, rewrite, rewrite","author":"Dershowitz","year":"1989"},{"key":"10.1016\/j.ic.2011.01.007_b0165","series-title":"Proceedings of the 16th International Colloquium on Automata, Languages and Programming (ICALP\u201989)","first-page":"249","article-title":"Infinite normal forms","volume":"vol. 372","author":"Dershowitz","year":"1989"},{"key":"10.1016\/j.ic.2011.01.007_b0170","series-title":"Proceedings of the Fourth Conference on Rewriting Techniques and Applications (RTA\u201991)","first-page":"13","article-title":"Redex capturing in term graph rewriting","volume":"vol. 488","author":"Farmer","year":"1991"},{"key":"10.1016\/j.ic.2011.01.007_b0175","unstructured":"R. Kennaway, V. van Oostrom, F.-J. de Vries, Meaningless terms in rewriting, The Journal of Functional and Logic Programming 1, 1999."},{"issue":"2","key":"10.1016\/j.ic.2011.01.007_b0180","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/S0304-3975(02)00809-5","article-title":"Infinitary lambda calculus and discrimination of Berarducci trees","volume":"298","author":"Dezani-Ciancaglini","year":"2003","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.ic.2011.01.007_b0185","series-title":"Proceedings of the 15th International Conference on Rewriting Techniques and Applications (RTA 2004)","first-page":"221","article-title":"An approximation based approach to infinitary lambda calculi","volume":"vol. 3091","author":"Blom","year":"2004"},{"issue":"2","key":"10.1016\/j.ic.2011.01.007_b0190","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s00236-007-0043-2","article-title":"Infinitary rewriting: meta-theory and convergence","volume":"44","author":"Kahrs","year":"2007","journal-title":"Acta Informatica"},{"issue":"6","key":"10.1016\/j.ic.2011.01.007_b0195","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1016\/j.ic.2006.02.005","article-title":"On modularity in infinitary rewriting","volume":"204","author":"Simonsen","year":"2006","journal-title":"Information and Computation"},{"key":"10.1016\/j.ic.2011.01.007_b0200","first-page":"169","article-title":"Infinitary normalization","volume":"vol. 2","author":"Klop","year":"2005"},{"issue":"4","key":"10.1016\/j.ic.2011.01.007_b0205","first-page":"415","article-title":"Infinite unfolding and transformations of nondeterministic programs","volume":"66","author":"Lisper","year":"2005","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/j.ic.2011.01.007_b0210","series-title":"General Topology","volume":"vol. 27","author":"Kelley","year":"1975"},{"key":"10.1016\/j.ic.2011.01.007_b0215","series-title":"Proceedings of the First International Workshop on Higher-Order Algebra, Logic, and Term Rewriting (HOA\u201993)","first-page":"169","article-title":"Compilation of combinatory reduction systems","volume":"vol. 816","author":"Kahrs","year":"1993"},{"issue":"1","key":"10.1016\/j.ic.2011.01.007_b0220","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/321992.321997","article-title":"Initial algebra semantics and continuous algebras","volume":"24","author":"Goguen","year":"1977","journal-title":"Journal of the ACM"},{"issue":"2","key":"10.1016\/j.ic.2011.01.007_b0225","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","article-title":"Fundamental properties of infinite trees","volume":"25","author":"Courcelle","year":"1983","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.ic.2011.01.007_b0230","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1145\/322108.322122","article-title":"Minimal and optimal computations of recursive programs","volume":"26","author":"Berry","year":"1979","journal-title":"Journal of the ACM"},{"key":"10.1016\/j.ic.2011.01.007_b0235","unstructured":"J. Ketema, B\u00f6hm-like trees for rewriting, Ph.D. Thesis, Vrije Universiteit, Amsterdam, 2006."},{"key":"10.1016\/j.ic.2011.01.007_b0240","series-title":"Proceedings of the 14th Symposium on Logic in Computer Science (LICS\u201999)","first-page":"193","article-title":"Abstract syntax and variable binding (extended abstract)","author":"Fiore","year":"1999"},{"key":"10.1016\/j.ic.2011.01.007_b0245","series-title":"Proceedings of the 13th International Conference on Rewriting Techniques and Applications (RTA 2002)","first-page":"159","article-title":"An extensional B\u00f6hm model","volume":"vol. 2378","author":"Severi","year":"2002"},{"key":"10.1016\/j.ic.2011.01.007_b0250","series-title":"Proceedings of the Nineth International IEEE Symposium on Logic in Computer Science (LICS\u201994)","first-page":"426","article-title":"Paths in the \u03bb-calculus","author":"Asperti","year":"1994"},{"issue":"2","key":"10.1016\/j.ic.2011.01.007_b0255","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0304-3975(94)00279-7","article-title":"Paths computations and labels in the \u03bb-calculus","volume":"142","author":"Asperti","year":"1995","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.ic.2011.01.007_b0260","series-title":"Handbook of Mathematical Logic","first-page":"233","article-title":"Admissible sets and infinitary logic","author":"Makkai","year":"1977"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540111000307?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540111000307?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T15:44:35Z","timestamp":1637250275000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540111000307"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":52,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["S0890540111000307"],"URL":"https:\/\/doi.org\/10.1016\/j.ic.2011.01.007","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2011,6]]}}}