{"id":"https://openalex.org/W2984542881","doi":"https://doi.org/10.1145/3371083","title":"Recurrence extraction for functional programs through call-by-push-value","display_name":"Recurrence extraction for functional programs through call-by-push-value","publication_year":2019,"publication_date":"2019-12-20","ids":{"openalex":"https://openalex.org/W2984542881","doi":"https://doi.org/10.1145/3371083","mag":"2984542881"},"language":"en","primary_location":{"id":"doi:10.1145/3371083","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3371083","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3371083","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3371083","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"G. A. Kavvos","orcid":null},"institutions":[{"id":"https://openalex.org/I100538780","display_name":"Wesleyan University","ror":"https://ror.org/05h7xva58","country_code":"US","type":"education","lineage":["https://openalex.org/I100538780"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"G. A. Kavvos","raw_affiliation_strings":["Wesleyan University, USA"],"affiliations":[{"raw_affiliation_string":"Wesleyan University, USA","institution_ids":["https://openalex.org/I100538780"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Edward Morehouse","orcid":null},"institutions":[{"id":"https://openalex.org/I100538780","display_name":"Wesleyan University","ror":"https://ror.org/05h7xva58","country_code":"US","type":"education","lineage":["https://openalex.org/I100538780"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Edward Morehouse","raw_affiliation_strings":["Wesleyan University, USA"],"affiliations":[{"raw_affiliation_string":"Wesleyan University, USA","institution_ids":["https://openalex.org/I100538780"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Daniel R. Licata","orcid":null},"institutions":[{"id":"https://openalex.org/I100538780","display_name":"Wesleyan University","ror":"https://ror.org/05h7xva58","country_code":"US","type":"education","lineage":["https://openalex.org/I100538780"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel R. Licata","raw_affiliation_strings":["Wesleyan University, USA"],"affiliations":[{"raw_affiliation_string":"Wesleyan University, USA","institution_ids":["https://openalex.org/I100538780"]}]},{"author_position":"last","author":{"id":null,"display_name":"Norman Danner","orcid":null},"institutions":[{"id":"https://openalex.org/I100538780","display_name":"Wesleyan University","ror":"https://ror.org/05h7xva58","country_code":"US","type":"education","lineage":["https://openalex.org/I100538780"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Norman Danner","raw_affiliation_strings":["Wesleyan University, USA"],"affiliations":[{"raw_affiliation_string":"Wesleyan University, USA","institution_ids":["https://openalex.org/I100538780"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I100538780"],"apc_list":null,"apc_paid":null,"fwci":1.1561,"has_fulltext":true,"cited_by_count":20,"citation_normalized_percentile":{"value":0.8472401,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"4","issue":"POPL","first_page":"1","last_page":"31"},"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.6854000091552734,"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.6854000091552734,"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/T10260","display_name":"Software Engineering Research","score":0.09889999777078629,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10639","display_name":"Advanced Software Engineering Methodologies","score":0.048500001430511475,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/syntax","display_name":"Syntax","score":0.6420000195503235},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.6363999843597412},{"id":"https://openalex.org/keywords/domain-theory","display_name":"Domain theory","score":0.6306999921798706},{"id":"https://openalex.org/keywords/denotational-semantics","display_name":"Denotational semantics","score":0.5947999954223633},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.5250999927520752},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.43290001153945923},{"id":"https://openalex.org/keywords/recursive-functions","display_name":"Recursive functions","score":0.3246999979019165},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.30480000376701355}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6640999913215637},{"id":"https://openalex.org/C60048249","wikidata":"https://www.wikidata.org/wiki/Q37437","display_name":"Syntax","level":2,"score":0.6420000195503235},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.6363999843597412},{"id":"https://openalex.org/C29585364","wikidata":"https://www.wikidata.org/wiki/Q1079166","display_name":"Domain theory","level":2,"score":0.6306999921798706},{"id":"https://openalex.org/C207648694","wikidata":"https://www.wikidata.org/wiki/Q1189746","display_name":"Denotational semantics","level":4,"score":0.5947999954223633},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5250999927520752},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.517799973487854},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.43290001153945923},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3393999934196472},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33410000801086426},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3296999931335449},{"id":"https://openalex.org/C2982939207","wikidata":"https://www.wikidata.org/wiki/Q1175101","display_name":"Recursive functions","level":2,"score":0.3246999979019165},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.30480000376701355},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.2989000082015991},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.29760000109672546},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2973000109195709},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.29409998655319214},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.28299999237060547},{"id":"https://openalex.org/C4725764","wikidata":"https://www.wikidata.org/wiki/Q844704","display_name":"Extraction (chemistry)","level":2,"score":0.28110000491142273},{"id":"https://openalex.org/C134765980","wikidata":"https://www.wikidata.org/wiki/Q879126","display_name":"Bitwise operation","level":2,"score":0.27869999408721924},{"id":"https://openalex.org/C103824480","wikidata":"https://www.wikidata.org/wiki/Q185889","display_name":"Time domain","level":2,"score":0.2660999894142151},{"id":"https://openalex.org/C128099668","wikidata":"https://www.wikidata.org/wiki/Q573952","display_name":"Lazy evaluation","level":3,"score":0.25589999556541443},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.2551000118255615},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2522999942302704}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3371083","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3371083","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3371083","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1911.04588","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1911.04588","pdf_url":"https://arxiv.org/pdf/1911.04588","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire/14867d08-cef8-40c4-a33c-6a929f14f569","is_oa":true,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/14867d08-cef8-40c4-a33c-6a929f14f569","pdf_url":"https://research-information.bris.ac.uk/files/243121237/recextr_2020_pub.pdf","source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kavvos, G A, Morehouse, E, Licata, D & Danner, N 2019, 'Recurrence extraction for functional programs through call-by-push-value', Proceedings of the ACM on Programming Languages, vol. 4, no. POPL, 15. https://doi.org/10.1145/3371083","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1145/3371083","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3371083","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3371083","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1523888516","display_name":null,"funder_award_id":"FA9550-","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G230078430","display_name":null,"funder_award_id":"FA9550-16","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G2428500810","display_name":null,"funder_award_id":"FA9550-16-1-0292","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G3392305090","display_name":null,"funder_award_id":"-16-1-","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G3616359867","display_name":null,"funder_award_id":"FA9550-16-1","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G5809100787","display_name":null,"funder_award_id":"FA9550","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G7090116110","display_name":null,"funder_award_id":"FA9550","funder_id":"https://openalex.org/F4320332467","funder_display_name":"U.S. Air Force"},{"id":"https://openalex.org/G8636602380","display_name":null,"funder_award_id":"1618203","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332467","display_name":"U.S. Air Force","ror":"https://ror.org/006gmme17"},{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2984542881.pdf","grobid_xml":"https://content.openalex.org/works/W2984542881.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W49202426","https://openalex.org/W587099212","https://openalex.org/W1507860656","https://openalex.org/W1508489761","https://openalex.org/W1512931629","https://openalex.org/W1719974439","https://openalex.org/W1973393028","https://openalex.org/W1982529770","https://openalex.org/W1987927249","https://openalex.org/W1992296379","https://openalex.org/W2003295303","https://openalex.org/W2007270285","https://openalex.org/W2020692742","https://openalex.org/W2024929322","https://openalex.org/W2025581658","https://openalex.org/W2028012052","https://openalex.org/W2039112578","https://openalex.org/W2079512738","https://openalex.org/W2087165885","https://openalex.org/W2094647969","https://openalex.org/W2094712524","https://openalex.org/W2135155734","https://openalex.org/W2141746484","https://openalex.org/W2165446401","https://openalex.org/W2547267640","https://openalex.org/W2596791023","https://openalex.org/W2753372626","https://openalex.org/W2780276625","https://openalex.org/W2901933418","https://openalex.org/W2906872399","https://openalex.org/W4211080362"],"related_works":[],"abstract_inverted_index":{"The":[0,48],"main":[1],"way":[2,81],"of":[3,7,12,25,28,43,67,70],"analysing":[4],"the":[5,26,41,62,68,71,110],"complexity":[6],"a":[8,16,33,55,79,105],"program":[9],"is":[10],"that":[11,18,35,82],"extracting":[13],"and":[14,86],"solving":[15],"recurrence":[17],"expresses":[19],"its":[20,29],"running":[21,63],"time":[22,64],"in":[23,54,65,78],"terms":[24,66],"size":[27,69],"input.":[30,72],"We":[31],"develop":[32,104],"method":[34],"automatically":[36],"extracts":[37],"such":[38],"recurrences":[39],"from":[40],"syntax":[42],"higher-order":[44],"recursive":[45],"functional":[46],"programs.":[47],"resulting":[49,111],"recurrences,":[50],"which":[51],"are":[52],"programs":[53],"call-by-name":[56,85],"language":[57],"with":[58],"recursion,":[59],"explicitly":[60],"compute":[61],"In":[73],"order":[74],"to":[75,103],"achieve":[76],"this":[77],"uniform":[80],"covers":[83],"both":[84],"call-by-value":[87],"evaluation":[88],"strategies,":[89],"we":[90,99],"use":[91,100],"Call-by-Push-Value":[92],"(CBPV)":[93],"as":[94],"an":[95],"intermediate":[96],"language.":[97],"Finally,":[98],"domain":[101],"theory":[102],"denotational":[106],"cost":[107],"semantics":[108],"for":[109],"recurrences.":[112]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2019-11-22T00:00:00"}