{"id":"https://openalex.org/W3006007823","doi":"https://doi.org/10.1017/s095679682200003x","title":"Denotational semantics as a foundation for cost recurrence extraction for functional languages","display_name":"Denotational semantics as a foundation for cost recurrence extraction for functional languages","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W3006007823","doi":"https://doi.org/10.1017/s095679682200003x","mag":"3006007823"},"language":"en","primary_location":{"id":"doi:10.1017/s095679682200003x","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s095679682200003x","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/BEC8FAB23FECD752D2968FD000E7C3C8/S095679682200003Xa.pdf/div-class-title-denotational-semantics-as-a-foundation-for-cost-recurrence-extraction-for-functional-languages-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/BEC8FAB23FECD752D2968FD000E7C3C8/S095679682200003Xa.pdf/div-class-title-denotational-semantics-as-a-foundation-for-cost-recurrence-extraction-for-functional-languages-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056512208","display_name":"Norman Danner","orcid":"https://orcid.org/0000-0003-1119-4982"},"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":"NORMAN DANNER","raw_affiliation_strings":["Wesleyan University, Middletown, CT06459, USA (e-mail:"],"affiliations":[{"raw_affiliation_string":"Wesleyan University, Middletown, CT06459, USA (e-mail:","institution_ids":["https://openalex.org/I100538780"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009198759","display_name":"Daniel R. Licata","orcid":"https://orcid.org/0000-0003-0697-7405"},"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, Middletown, CT06459, USA (e-mail:"],"affiliations":[{"raw_affiliation_string":"Wesleyan University, Middletown, CT06459, USA (e-mail:","institution_ids":["https://openalex.org/I100538780"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5056512208"],"corresponding_institution_ids":["https://openalex.org/I100538780"],"apc_list":null,"apc_paid":null,"fwci":0.1388,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.50765037,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"32","issue":null,"first_page":null,"last_page":null},"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.9998999834060669,"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.9998999834060669,"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/T10142","display_name":"Formal Methods in Verification","score":0.9983000159263611,"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"}},{"id":"https://openalex.org/T10260","display_name":"Software Engineering Research","score":0.9968000054359436,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8116270303726196},{"id":"https://openalex.org/keywords/denotational-semantics","display_name":"Denotational semantics","score":0.5965355038642883},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.5005650520324707},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.4616588056087494},{"id":"https://openalex.org/keywords/abstract-interpretation","display_name":"Abstract interpretation","score":0.46161210536956787},{"id":"https://openalex.org/keywords/argument","display_name":"Argument (complex analysis)","score":0.45769578218460083},{"id":"https://openalex.org/keywords/domain-theory","display_name":"Domain theory","score":0.4488369822502136},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4183369576931},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.4161558151245117},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2438463568687439},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.21830672025680542},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.1617949903011322},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14983394742012024},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.09837859869003296}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8116270303726196},{"id":"https://openalex.org/C207648694","wikidata":"https://www.wikidata.org/wiki/Q1189746","display_name":"Denotational semantics","level":4,"score":0.5965355038642883},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.5005650520324707},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.4616588056087494},{"id":"https://openalex.org/C2780654840","wikidata":"https://www.wikidata.org/wiki/Q333341","display_name":"Abstract interpretation","level":2,"score":0.46161210536956787},{"id":"https://openalex.org/C98184364","wikidata":"https://www.wikidata.org/wiki/Q1780131","display_name":"Argument (complex analysis)","level":2,"score":0.45769578218460083},{"id":"https://openalex.org/C29585364","wikidata":"https://www.wikidata.org/wiki/Q1079166","display_name":"Domain theory","level":2,"score":0.4488369822502136},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4183369576931},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.4161558151245117},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2438463568687439},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.21830672025680542},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.1617949903011322},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14983394742012024},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.09837859869003296},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s095679682200003x","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s095679682200003x","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/BEC8FAB23FECD752D2968FD000E7C3C8/S095679682200003Xa.pdf/div-class-title-denotational-semantics-as-a-foundation-for-cost-recurrence-extraction-for-functional-languages-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2002.07262","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2002.07262","pdf_url":"https://arxiv.org/pdf/2002.07262","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"}],"best_oa_location":{"id":"doi:10.1017/s095679682200003x","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s095679682200003x","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/BEC8FAB23FECD752D2968FD000E7C3C8/S095679682200003Xa.pdf/div-class-title-denotational-semantics-as-a-foundation-for-cost-recurrence-extraction-for-functional-languages-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"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"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3006007823.pdf","grobid_xml":"https://content.openalex.org/works/W3006007823.grobid-xml"},"referenced_works_count":83,"referenced_works":["https://openalex.org/W13464817","https://openalex.org/W30585784","https://openalex.org/W49202426","https://openalex.org/W1230660382","https://openalex.org/W1580184003","https://openalex.org/W1760139041","https://openalex.org/W1966928697","https://openalex.org/W1982529770","https://openalex.org/W1991865448","https://openalex.org/W1992296379","https://openalex.org/W2003295303","https://openalex.org/W2005192022","https://openalex.org/W2020692742","https://openalex.org/W2024873396","https://openalex.org/W2025581658","https://openalex.org/W2037984920","https://openalex.org/W2043100293","https://openalex.org/W2050400596","https://openalex.org/W2051600983","https://openalex.org/W2052447934","https://openalex.org/W2057292961","https://openalex.org/W2060213695","https://openalex.org/W2066550846","https://openalex.org/W2068055184","https://openalex.org/W2073629816","https://openalex.org/W2081280627","https://openalex.org/W2084788336","https://openalex.org/W2093397547","https://openalex.org/W2094647969","https://openalex.org/W2094712524","https://openalex.org/W2095867533","https://openalex.org/W2105045857","https://openalex.org/W2112955239","https://openalex.org/W2112969535","https://openalex.org/W2135155734","https://openalex.org/W2137062096","https://openalex.org/W2138657070","https://openalex.org/W2171496589","https://openalex.org/W2172307690","https://openalex.org/W2408512871","https://openalex.org/W2547267640","https://openalex.org/W2565334366","https://openalex.org/W2565821150","https://openalex.org/W2569392808","https://openalex.org/W2596791023","https://openalex.org/W2615175639","https://openalex.org/W2753372626","https://openalex.org/W2757243080","https://openalex.org/W2763435855","https://openalex.org/W2776364995","https://openalex.org/W2780276625","https://openalex.org/W2786061344","https://openalex.org/W2798025005","https://openalex.org/W2885649062","https://openalex.org/W2899269697","https://openalex.org/W2900015620","https://openalex.org/W2901933418","https://openalex.org/W2914680059","https://openalex.org/W2937166643","https://openalex.org/W2950779144","https://openalex.org/W2954494349","https://openalex.org/W2964083189","https://openalex.org/W2966669184","https://openalex.org/W2984542881","https://openalex.org/W2995074506","https://openalex.org/W3037295748","https://openalex.org/W3047432916","https://openalex.org/W3099676796","https://openalex.org/W3101726082","https://openalex.org/W3104440546","https://openalex.org/W3106191599","https://openalex.org/W3115656330","https://openalex.org/W3145350942","https://openalex.org/W3201110005","https://openalex.org/W4210285581","https://openalex.org/W4236324644","https://openalex.org/W4256675088","https://openalex.org/W4300885858","https://openalex.org/W6651035605","https://openalex.org/W6675806528","https://openalex.org/W6680709183","https://openalex.org/W6682237761","https://openalex.org/W6838107274"],"related_works":["https://openalex.org/W3036972880","https://openalex.org/W2604377475","https://openalex.org/W2803229276","https://openalex.org/W2952451744","https://openalex.org/W4298869501","https://openalex.org/W2126542638","https://openalex.org/W1966054964","https://openalex.org/W2110748634","https://openalex.org/W1584038246","https://openalex.org/W1486532074"],"abstract_inverted_index":{"Abstract":[0],"A":[1],"standard":[2],"informal":[3,191],"method":[4,48,61],"for":[5,49,172],"analyzing":[6,121,141],"the":[7,25,67,81,85,88,138,152,162,168,177,196],"asymptotic":[8],"complexity":[9],"of":[10,24,27,46,63,80,99,110,126,131,154,156,161,170,176,184,198],"a":[11,16,34,43,53,70,77,94],"program":[12,90],"is":[13,73,91,103,165],"to":[14,32,75,167,194],"extract":[15,76],"recurrence":[17],"that":[18,39,47,104,123,147,164,187],"describes":[19],"its":[20,28],"cost":[21,192],"in":[22,52,93,115,159],"terms":[23,160],"size":[26,132,155,171],"input":[29],"and":[30],"then":[31],"compute":[33],"closed-form":[35],"upper":[36],"bound":[37],"on":[38,137],"recurrence.":[40],"We":[41,180],"give":[42,181],"formal":[44],"account":[45],"functional":[50],"programs":[51],"higher":[54],"order":[55],"language":[56],"with":[57],"$\\mathtt{let}$":[58],"-polymorphism.":[59],"The":[60,96],"consists":[62],"two":[64],"phases.":[65],"In":[66,84],"first":[68],"phase,":[69,87],"monadic":[71],"translation":[72],"performed":[74],"cost-annotated":[78],"version":[79],"original":[82],"program.":[83],"second":[86,101],"extracted":[89],"interpreted":[92],"model.":[95],"key":[97],"feature":[98],"this":[100],"phase":[102],"different":[105,108,129,185],"models":[106,186],"describe":[107,151],"notions":[109,130,169],"size.":[111],"This":[112],"plays":[113],"out":[114],"several":[116,182],"ways.":[117],"For":[118],"example,":[119],"when":[120],"functions":[122],"take":[124],"arguments":[125],"inductive":[127],"types,":[128],"may":[133],"be":[134],"appropriate":[135],"depending":[136],"analysis.":[139],"When":[140],"polymorphic":[142],"functions,":[143],"our":[144,199],"approach":[145],"shows":[146],"one":[148],"can":[149],"formally":[150,188],"notion":[153],"an":[157],"argument":[158],"data":[163],"common":[166],"each":[173],"type":[174],"instance":[175],"domain":[178],"type.":[179],"examples":[183],"justify":[189],"various":[190],"analyses":[193],"show":[195],"applicability":[197],"approach.":[200]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-23T09:07:50.710637","created_date":"2025-10-10T00:00:00"}