{"id":"https://openalex.org/W2112108083","doi":"https://doi.org/10.1145/2034675.2034680","title":"Termination combinators forever","display_name":"Termination combinators forever","publication_year":2011,"publication_date":"2011-09-22","ids":{"openalex":"https://openalex.org/W2112108083","doi":"https://doi.org/10.1145/2034675.2034680","mag":"2112108083"},"language":"en","primary_location":{"id":"doi:10.1145/2034675.2034680","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2034675.2034680","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 4th ACM symposium on Haskell","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075592571","display_name":"Maximilian Bolingbroke","orcid":null},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Maximilian Bolingbroke","raw_affiliation_strings":["University of Cambridge, Cambridge, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Cambridge, Cambridge, United Kingdom","institution_ids":["https://openalex.org/I241749"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027817074","display_name":"Simon Peyton Jones","orcid":"https://orcid.org/0000-0002-6085-1435"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB","US"],"is_corresponding":false,"raw_author_name":"Simon Peyton Jones","raw_affiliation_strings":["Microsoft Research Cambridge, Cambridge, United Kingdom","Microsoft Research Cambridge, Cambridge, United Kingdom#TAB#"],"affiliations":[{"raw_affiliation_string":"Microsoft Research Cambridge, Cambridge, United Kingdom","institution_ids":["https://openalex.org/I4210164937"]},{"raw_affiliation_string":"Microsoft Research Cambridge, Cambridge, United Kingdom#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029108294","display_name":"Dimitrios Vytiniotis","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB","US"],"is_corresponding":false,"raw_author_name":"Dimitrios Vytiniotis","raw_affiliation_strings":["Microsoft Research Cambridge, Cambridge, United Kingdom","Microsoft Research Cambridge, Cambridge, United Kingdom#TAB#"],"affiliations":[{"raw_affiliation_string":"Microsoft Research Cambridge, Cambridge, United Kingdom","institution_ids":["https://openalex.org/I4210164937"]},{"raw_affiliation_string":"Microsoft Research Cambridge, Cambridge, United Kingdom#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5075592571"],"corresponding_institution_ids":["https://openalex.org/I241749"],"apc_list":null,"apc_paid":null,"fwci":0.8805,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.80882008,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"23","last_page":"34"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatory-logic","display_name":"Combinatory logic","score":0.9861655235290527},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7473059892654419},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5846118927001953},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35118699073791504}],"concepts":[{"id":"https://openalex.org/C79678938","wikidata":"https://www.wikidata.org/wiki/Q1481571","display_name":"Combinatory logic","level":2,"score":0.9861655235290527},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7473059892654419},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5846118927001953},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35118699073791504}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/2034675.2034680","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2034675.2034680","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 4th ACM symposium on Haskell","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.224.9476","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.224.9476","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.research.microsoft.com/%7Esimonpj/papers/supercompilation/termination-combinators.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.225.7420","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.225.7420","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.microsoft.com/en-us/people/dimitris/haskell11-bolingbrokeps.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.352.2863","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.352.2863","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.microsoft.com/pubs/162512/p23-bolingbroke.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.363.5705","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.363.5705","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cl.cam.ac.uk/~mb566/papers/termination-combinators-hs11.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W204886091","https://openalex.org/W338020252","https://openalex.org/W1528500212","https://openalex.org/W1539550612","https://openalex.org/W1558109178","https://openalex.org/W1575675278","https://openalex.org/W1768450951","https://openalex.org/W1783634269","https://openalex.org/W1919687110","https://openalex.org/W2013423850","https://openalex.org/W2018765574","https://openalex.org/W2076972393","https://openalex.org/W2111863285","https://openalex.org/W2124909257","https://openalex.org/W2148437863","https://openalex.org/W2157543955","https://openalex.org/W2163841074","https://openalex.org/W2167268698","https://openalex.org/W2173780645","https://openalex.org/W2293708017","https://openalex.org/W2295174177","https://openalex.org/W2561675875","https://openalex.org/W4232668957","https://openalex.org/W4242857932"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2026765907","https://openalex.org/W4307413753","https://openalex.org/W1975604118","https://openalex.org/W119766800","https://openalex.org/W2135888537","https://openalex.org/W2183434207","https://openalex.org/W2147822230"],"abstract_inverted_index":{"We":[0,34],"describe":[1],"a":[2],"library-based":[3],"approach":[4],"to":[5,42],"constructing":[6],"termination":[7,12,28,48],"tests":[8,29],"suitable":[9],"for":[10],"controlling":[11],"of":[13,46,53,58],"symbolic":[14],"methods":[15],"such":[16],"as":[17],"partial":[18],"evaluation,":[19],"supercompilation":[20],"and":[21],"theorem":[22],"proving.":[23],"With":[24],"our":[25],"combinators,":[26],"all":[27],"are":[30],"correct":[31],"by":[32],"construction.":[33],"show":[35],"how":[36],"the":[37,47,51,54],"library":[38,55],"can":[39],"be":[40],"designed":[41],"embody":[43],"various":[44],"optimisations":[45],"tests,":[49],"which":[50],"user":[52],"takes":[56],"advantage":[57],"entirely":[59],"transparently.":[60]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}