{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:33Z","timestamp":1772163993582,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,9,22]],"date-time":"2011-09-22T00:00:00Z","timestamp":1316649600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,9,22]]},"DOI":"10.1145\/2034675.2034680","type":"proceedings-article","created":{"date-parts":[[2011,9,23]],"date-time":"2011-09-23T11:13:10Z","timestamp":1316776390000},"page":"23-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Termination combinators forever"],"prefix":"10.1145","author":[{"given":"Maximilian","family":"Bolingbroke","sequence":"first","affiliation":[{"name":"University of Cambridge, Cambridge, United Kingdom"}]},{"given":"Simon","family":"Peyton Jones","sequence":"additional","affiliation":[{"name":"Microsoft Research Cambridge, Cambridge, United Kingdom"}]},{"given":"Dimitrios","family":"Vytiniotis","sequence":"additional","affiliation":[{"name":"Microsoft Research Cambridge, Cambridge, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2011,9,22]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"210","article-title":"Trans","volume":"95","author":"Kruskal JB","year":"1960","unstructured":"JB Kruskal . Well-quasi-ordering, the Tree Theorem , and Vazsonyi's conjecture. Trans . Amer. Math. Soc , 95 : 210 -- 225 , 1960 . JB Kruskal. Well-quasi-ordering, the Tree Theorem, and Vazsonyi's conjecture. Trans. Amer. Math. Soc, 95: 210--225, 1960.","journal-title":"Amer. Math. Soc"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863588"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49727-7_14"},{"key":"e_1_3_2_2_4_1","first-page":"531","volume-title":"The algorithm of generalization in the supercompiler","author":"Turchin Valentin F.","year":"1988","unstructured":"Valentin F. Turchin . The algorithm of generalization in the supercompiler . Dines Bj\u00f8rner, Andrei P. Ershov, and Neil D. Jones, editors, Partial Evaluation and Mixed Computation , pages 531 -- 549 , 1988 . Valentin F. Turchin. The algorithm of generalization in the supercompiler. Dines Bj\u00f8rner, Andrei P. Ershov, and Neil D. Jones, editors, Partial Evaluation and Mixed Computation, pages 531--549, 1988."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100003844"},{"key":"e_1_3_2_2_6_1","volume-title":"The Glasgow Haskell compiler: a technical overview","author":"Jones Simon Peyton","year":"1992","unstructured":"Simon Peyton Jones , Cordy Hall , Kevin Hammond , Jones Cordy , Kevin Hall , Will Partain , and Phil Wadler . The Glasgow Haskell compiler: a technical overview , 1992 . Simon Peyton Jones, Cordy Hall, Kevin Hammond, Jones Cordy, Kevin Hall, Will Partain, and Phil Wadler. The Glasgow Haskell compiler: a technical overview, 1992."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796809007291"},{"key":"e_1_3_2_2_8_1","volume-title":"under the hood. Preprint 63","author":"Klyuchnikov Ilya","year":"2009","unstructured":"Ilya Klyuchnikov . Supercompiler HOSC 1.0 : under the hood. Preprint 63 , Keldysh Institute of Applied Mathematics , Moscow , 2009 . URL http:\/\/library.keldysh.ru\/preprint.asp?lg=e&id=2009-63. Ilya Klyuchnikov. Supercompiler HOSC 1.0: under the hood. Preprint 63, Keldysh Institute of Applied Mathematics, Moscow, 2009. URL http:\/\/library.keldysh.ru\/preprint.asp?lg=e&id=2009-63."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480916"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1244381.1244391"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863523.1863540"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(91)90022-E"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1018438.1021840"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134029"},{"key":"e_1_3_2_2_15_1","first-page":"1","volume-title":"RTA","author":"Neil","year":"2004","unstructured":"Neil D. Jones and Nina Bohr. Termination analysis of the untyped lamba-calculus . In RTA , pages 1 -- 23 , 2004 . Neil D. Jones and Nina Bohr. Termination analysis of the untyped lamba-calculus. In RTA, pages 1--23, 2004."},{"key":"e_1_3_2_2_16_1","volume-title":"homeomorphic embedding and generalization in a higher-order setting. Preprint 62","author":"Klyuchnikov Ilya","year":"2010","unstructured":"Ilya Klyuchnikov . Supercompiler HOSC 1.5 : homeomorphic embedding and generalization in a higher-order setting. Preprint 62 , Keldysh Institute of Applied Mathematics , Moscow , 2010 . URL http:\/\/pat.keldysh.ru\/ ilya\/preprints\/HOSC15_en.pdf. Ilya Klyuchnikov. Supercompiler HOSC 1.5: homeomorphic embedding and generalization in a higher-order setting. Preprint 62, Keldysh Institute of Applied Mathematics, Moscow, 2010. URL http:\/\/pat.keldysh.ru\/ ilya\/preprints\/HOSC15_en.pdf."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"Jeremy\n      Gibbons\n    .\n  Datatype-generic programming\n  . In Roland Backhouse Jeremy Gibbons Ralf Hinze and Johan Jeuring editors Datatype-Generic Programming volume \n  4719\n   of \n  Lecture Notes in Computer Science pages \n  1\n  --\n  71\n  . \n  Springer Berlin \/ Heidelberg 2007\n  . URL http:\/\/dx.doi.org\/10.1007\/978-3-540-76786-2_1.     10.1007\/978-3-540-76786-2_1\nJeremy Gibbons. Datatype-generic programming. In Roland Backhouse Jeremy Gibbons Ralf Hinze and Johan Jeuring editors Datatype-Generic Programming volume 4719 of Lecture Notes in Computer Science pages 1--71. Springer Berlin \/ Heidelberg 2007. URL http:\/\/dx.doi.org\/10.1007\/978-3-540-76786-2_1.","DOI":"10.1007\/978-3-540-76786-2_1"},{"key":"e_1_3_2_2_19_1","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Generic Programming","author":"Hinze Ralf","year":"2003","unstructured":"Ralf Hinze and Johan Jeuring . Generic Haskell: Practice and theory . In Roland Backhouse and Jeremy Gibbons, editors, Generic Programming , volume 2793 of Lecture Notes in Computer Science , pages 1 -- 56 . Springer Berlin \/ Heidelberg , 2003 . URL http:\/\/dx.doi.org\/10.1007\/978-3-540-45191-4_1. 10.1007\/978-3-540-45191-4_1 Ralf Hinze and Johan Jeuring. Generic Haskell: Practice and theory. In Roland Backhouse and Jeremy Gibbons, editors, Generic Programming, volume 2793 of Lecture Notes in Computer Science, pages 1--56. Springer Berlin \/ Heidelberg, 2003. URL http:\/\/dx.doi.org\/10.1007\/978-3-540-45191-4_1."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1631687.1596585"}],"event":{"name":"ICFP '11: ACM SIGPLAN International Conference on Functional Programming","location":"Tokyo Japan","acronym":"ICFP '11","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 4th ACM symposium on Haskell"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2034675.2034680","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2034675.2034680","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:26Z","timestamp":1750225706000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2034675.2034680"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,22]]},"references-count":19,"alternative-id":["10.1145\/2034675.2034680","10.1145\/2034675"],"URL":"https:\/\/doi.org\/10.1145\/2034675.2034680","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2096148.2034680","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2011,9,22]]},"assertion":[{"value":"2011-09-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}