{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:39Z","timestamp":1772163999905,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,10,1]],"date-time":"2007-10-01T00:00:00Z","timestamp":1191196800000},"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":[[2007,10]]},"DOI":"10.1145\/1291151.1291165","type":"proceedings-article","created":{"date-parts":[[2007,10,14]],"date-time":"2007-10-14T08:51:38Z","timestamp":1192351898000},"page":"71-84","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Termination analysis and call graph construction for higher-order functional programs"],"prefix":"10.1145","author":[{"given":"Damien","family":"Sereni","sequence":"first","affiliation":[{"name":"Oxford University, Oxford, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11737414_14"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_35"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134029"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_37"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512973"},{"key":"e_1_3_2_1_6_1","series-title":"Bigre","volume-title":"Actes JTASPEFL '91","author":"Cousot Patrick","year":"1991","unstructured":"Patrick Cousot and Radhia Cousot . Relational abstract interpretation of higher-order functional programs . In Actes JTASPEFL '91 , volume 74 of Bigre , 1991 . Patrick Cousot and Radhia Cousot. Relational abstract interpretation of higher-order functional programs. In Actes JTASPEFL '91, volume 74 of Bigre, 1991."},{"key":"e_1_3_2_1_7_1","first-page":"95","volume-title":"Proceedings of the IEEE International Conference on Computer Languages (ICLL '94)","author":"Cousot Patrick","year":"1994","unstructured":"Patrick Cousot and Radhia Cousot . Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and PER analysis of functional languages), invited paper . In Proceedings of the IEEE International Conference on Computer Languages (ICLL '94) , pages 95 -- 112 . IEEE Computer Society Press , 1994 . Patrick Cousot and Radhia Cousot. Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and PER analysis of functional languages), invited paper. In Proceedings of the IEEE International Conference on Computer Languages (ICLL '94), pages 95--112. IEEE Computer Society Press, 1994."},{"key":"e_1_3_2_1_8_1","volume-title":"D-442). Available online at http:\/\/www.diku.dk\/topps\/bibliography\/2001.html","author":"Frederiksen Carl Christian","year":"2001","unstructured":"Carl Christian Frederiksen . A simple implementation of the size-change termination principle. Working paper (DIKU , D-442). Available online at http:\/\/www.diku.dk\/topps\/bibliography\/2001.html , 2001 . Carl Christian Frederiksen. A simple implementation of the size-change termination principle. Working paper (DIKU, D-442). Available online at http:\/\/www.diku.dk\/topps\/bibliography\/2001.html, 2001."},{"key":"e_1_3_2_1_9_1","series-title":"LNCS","first-page":"210","volume-title":"Proceedings of RTA '04","author":"Giesl J\u00fcrgen","year":"2004","unstructured":"J\u00fcrgen Giesl , Ren\u00e9 Thiemann , Peter Schneider-Kamp , and Stephan Falke . Automated termination proofs with AProVE . In Proceedings of RTA '04 , volume 3091 of LNCS , pages 210 -- 220 . Springer , 2004 . J\u00fcrgen Giesl, Ren\u00e9 Thiemann, Peter Schneider-Kamp, and Stephan Falke. Automated termination proofs with AProVE. In Proceedings of RTA '04, volume 3091 of LNCS, pages 210--220. Springer, 2004."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11559306_12"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11805618_23"},{"key":"e_1_3_2_1_12_1","series-title":"LNCS","first-page":"190","volume-title":"Proceedings of FPCA '85","author":"Johnsson Thomas","year":"1985","unstructured":"Thomas Johnsson . Lambda lifting: Transforming programs to recursive equations . In Proceedings of FPCA '85 , volume 201 of LNCS , pages 190 -- 203 . Springer , 1985 . Thomas Johnsson. Lambda lifting: Transforming programs to recursive equations. In Proceedings of FPCA '85, volume 201 of LNCS, pages 190--203. Springer, 1985."},{"key":"e_1_3_2_1_13_1","first-page":"103","volume-title":"Abstract Interpretation of Declarative Languages","author":"Jones Neil D.","year":"1987","unstructured":"Neil D. Jones . Flow analysis of lazy higher-order functional programs. In Samson Abramsky and Chris Hankin, editors , Abstract Interpretation of Declarative Languages , pages 103 -- 122 . Ellis Horwood , 1987 . Neil D. Jones. Flow analysis of lazy higher-order functional programs. In Samson Abramsky and Chris Hankin, editors, Abstract Interpretation of Declarative Languages, pages 103--122. Ellis Horwood, 1987."},{"key":"e_1_3_2_1_14_1","series-title":"LNCS","volume-title":"Proceedings of RTA '04","author":"Neil","year":"2004","unstructured":"Neil D. Jones and Nina Bohr. Termination analysis of the untyped \u03bb-calculus . In Proceedings of RTA '04 , volume 3091 of LNCS . Springer , 2004 . Neil D. Jones and Nina Bohr. Termination analysis of the untyped \u03bb-calculus. In Proceedings of RTA '04, volume 3091 of LNCS. Springer, 2004."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/360204.360210"},{"key":"e_1_3_2_1_16_1","volume-title":"Checking termination of queries to logic programs. Available online at http:\/\/www.cs.huji.ac.il\/~naomil\/","author":"Lindenstrauss Naomi","year":"1996","unstructured":"Naomi Lindenstrauss and Yehoshua Sagiv . Checking termination of queries to logic programs. Available online at http:\/\/www.cs.huji.ac.il\/~naomil\/ , 1996 . Naomi Lindenstrauss and Yehoshua Sagiv. Checking termination of queries to logic programs. Available online at http:\/\/www.cs.huji.ac.il\/~naomil\/, 1996."},{"key":"e_1_3_2_1_17_1","first-page":"63","volume-title":"Proceedings of ICLP '97","author":"Lindenstrauss Naomi","year":"1997","unstructured":"Naomi Lindenstrauss and Yehoshua Sagiv . Automatic termination analysis of logic programs . In Proceedings of ICLP '97 , pages 63 -- 77 . MIT Press , 1997 . Naomi Lindenstrauss and Yehoshua Sagiv. Automatic termination analysis of logic programs. In Proceedings of ICLP '97, pages 63--77. MIT Press, 1997."},{"key":"e_1_3_2_1_18_1","series-title":"LNCS","first-page":"95","volume-title":"Proceedings of CC '98","author":"Malacaria Pasquale","year":"1998","unstructured":"Pasquale Malacaria and Chris Hankin . A new approach to control flow analysis . In Proceedings of CC '98 , volume 1383 of LNCS , pages 95 -- 108 . Springer , 1998 . Pasquale Malacaria and Chris Hankin. A new approach to control flow analysis. In Proceedings of CC '98, volume 1383 of LNCS, pages 95--108. Springer, 1998."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159803.1159807"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/549659"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1058"},{"key":"e_1_3_2_1_22_1","volume-title":"The Implementation of Functional Programming Languages","author":"Peyton-Jones Simon","year":"1987","unstructured":"Simon Peyton-Jones . The Implementation of Functional Programming Languages . Prentice-Hall , 1987 . Out of print. Online version available at http:\/\/research.microsoft.com\/users\/simonpj\/papers\/slpj-book-1987\/. Simon Peyton-Jones. The Implementation of Functional Programming Languages. Prentice-Hall, 1987. Out of print. Online version available at http:\/\/research.microsoft.com\/users\/simonpj\/papers\/slpj-book-1987\/."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1040305.1040317"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/11575467_19"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/53990.54007"}],"event":{"name":"ICFP07: ACM SIGPLAN International Conference on Functional Programming","location":"Freiburg Germany","acronym":"ICFP07","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 12th ACM SIGPLAN international conference on Functional programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1291151.1291165","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1291151.1291165","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:26Z","timestamp":1750243946000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1291151.1291165"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10]]},"references-count":25,"alternative-id":["10.1145\/1291151.1291165","10.1145\/1291151"],"URL":"https:\/\/doi.org\/10.1145\/1291151.1291165","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1291220.1291165","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2007,10]]},"assertion":[{"value":"2007-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}