{"id":"https://openalex.org/W2094647969","doi":"https://doi.org/10.1145/2784731.2784749","title":"Denotational cost semantics for functional languages with inductive types","display_name":"Denotational cost semantics for functional languages with inductive types","publication_year":2015,"publication_date":"2015-08-26","ids":{"openalex":"https://openalex.org/W2094647969","doi":"https://doi.org/10.1145/2784731.2784749","mag":"2094647969"},"language":"en","primary_location":{"id":"doi:10.1145/2784731.2784749","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2784731.2784749","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming","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/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, USA"],"affiliations":[{"raw_affiliation_string":"Wesleyan University, USA","institution_ids":["https://openalex.org/I100538780"]}]},{"author_position":"middle","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, USA"],"affiliations":[{"raw_affiliation_string":"Wesleyan University, USA","institution_ids":["https://openalex.org/I100538780"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034060796","display_name":"Ramyaa Ramyaa","orcid":"https://orcid.org/0000-0002-4343-535X"},"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":"Ramyaa Ramyaa","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":3,"corresponding_author_ids":["https://openalex.org/A5056512208"],"corresponding_institution_ids":["https://openalex.org/I100538780"],"apc_list":null,"apc_paid":null,"fwci":8.9022,"has_fulltext":false,"cited_by_count":49,"citation_normalized_percentile":{"value":0.97697715,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"140","last_page":"151"},"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.998199999332428,"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.9954000115394592,"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.7758924961090088},{"id":"https://openalex.org/keywords/programmer","display_name":"Programmer","score":0.5508659482002258},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5357882380485535},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.531003475189209},{"id":"https://openalex.org/keywords/preorder","display_name":"Preorder","score":0.49985456466674805},{"id":"https://openalex.org/keywords/denotational-semantics","display_name":"Denotational semantics","score":0.48850691318511963},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4695848822593689},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43287771940231323},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.431194931268692},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.23546722531318665},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18393823504447937},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.12256112694740295}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7758924961090088},{"id":"https://openalex.org/C2778514511","wikidata":"https://www.wikidata.org/wiki/Q1374194","display_name":"Programmer","level":2,"score":0.5508659482002258},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5357882380485535},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.531003475189209},{"id":"https://openalex.org/C2333172","wikidata":"https://www.wikidata.org/wiki/Q1425985","display_name":"Preorder","level":2,"score":0.49985456466674805},{"id":"https://openalex.org/C207648694","wikidata":"https://www.wikidata.org/wiki/Q1189746","display_name":"Denotational semantics","level":4,"score":0.48850691318511963},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4695848822593689},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43287771940231323},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.431194931268692},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.23546722531318665},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18393823504447937},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.12256112694740295},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2784731.2784749","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2784731.2784749","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming","raw_type":"proceedings-article"},{"id":"pmh:oai:wesscholar.wesleyan.edu:compfacpub-1035","is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?doid=2858949.2784749","pdf_url":null,"source":{"id":"https://openalex.org/S4377196519","display_name":"Wesleyan University Digital Collections (Wesleyan University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I100538780","host_organization_name":"Wesleyan University","host_organization_lineage":["https://openalex.org/I100538780"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Faculty Scholarship","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4616984285","display_name":null,"funder_award_id":"1318864","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8588608984","display_name":null,"funder_award_id":"FA9550-15-1-0053","funder_id":"https://openalex.org/F4320338294","funder_display_name":"Air Force Research Laboratory"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320338294","display_name":"Air Force Research Laboratory","ror":"https://ror.org/02e2egq70"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W13464817","https://openalex.org/W912214939","https://openalex.org/W1230660382","https://openalex.org/W1500138362","https://openalex.org/W1760139041","https://openalex.org/W1982529770","https://openalex.org/W1982866418","https://openalex.org/W1992296379","https://openalex.org/W1997143185","https://openalex.org/W2003295303","https://openalex.org/W2012069736","https://openalex.org/W2025581658","https://openalex.org/W2037984920","https://openalex.org/W2041058737","https://openalex.org/W2051600983","https://openalex.org/W2060213695","https://openalex.org/W2073629816","https://openalex.org/W2094647969","https://openalex.org/W2094712524","https://openalex.org/W2105045857","https://openalex.org/W2111366004","https://openalex.org/W2112955239","https://openalex.org/W2112969535","https://openalex.org/W2114980032","https://openalex.org/W2135155734","https://openalex.org/W2172307690","https://openalex.org/W4302984605"],"related_works":["https://openalex.org/W2048999490","https://openalex.org/W1484366641","https://openalex.org/W2010343316","https://openalex.org/W2078105844","https://openalex.org/W1543138809","https://openalex.org/W2104462386","https://openalex.org/W2483009111","https://openalex.org/W156121174","https://openalex.org/W3134150944","https://openalex.org/W1997305605"],"abstract_inverted_index":{"A":[0],"central":[1],"method":[2],"for":[3,191],"analyzing":[4],"the":[5,44,49,56,70,98,123,147,165,194,205],"asymptotic":[6],"complexity":[7,128,148,166],"of":[8,26,32,46,58,69,72,90,93,146,164,172,204],"a":[9,18,39,47,53,59,66,87,107,110,119,127,156,178],"functional":[10,79],"program":[11],"is":[12,35,196],"to":[13,38,126,155,202],"extract":[14,106],"and":[15,55,74,95,130,199],"then":[16,131],"solve":[17],"recurrence":[19,108],"that":[20,97,182],"expresses":[21],"evaluation":[22,103,192],"cost":[23,73],"in":[24,52,144],"terms":[25],"input":[27,33],"size.":[28,173],"The":[29],"relevant":[30],"notion":[31],"size":[34,75],"often":[36],"specific":[37],"datatype,":[40],"with":[41],"measures":[42],"including":[43],"length":[45],"list,":[48,54],"maximum":[50],"element":[51],"height":[57],"tree.":[60],"In":[61],"this":[62,186],"work,":[63],"we":[64,112,175,207],"give":[65,160],"formal":[67],"account":[68],"extraction":[71],"recurrences":[76,100,183],"from":[77,109,122],"higher-order":[78],"programs":[80],"over":[81],"inductive":[82],"datatypes.":[83],"Our":[84],"approach":[85],"allows":[86],"wide":[88],"range":[89],"programmer-specified":[91],"notions":[92,171],"size,":[94],"ensures":[96],"extracted":[99,184],"correctly":[101],"predict":[102],"cost.":[104],"To":[105],"program,":[111],"first":[113],"make":[114],"costs":[115],"explicit":[116],"by":[117,152,177,185],"applying":[118],"monadic":[120],"translation":[121],"source":[124],"language":[125],"language,":[129,149,167],"abstract":[132],"datatype":[133],"values":[134],"as":[135],"sizes.":[136],"Size":[137],"abstraction":[138],"can":[139],"be":[140],"done":[141],"semantically,":[142],"working":[143],"models":[145,163,206],"or":[150],"syntactically,":[151],"adding":[153],"rules":[154],"preorder":[157],"judgement.":[158],"We":[159],"several":[161],"different":[162,170],"which":[168],"support":[169],"Additionally,":[174],"prove":[176],"logical":[179],"relations":[180],"argument":[181],"process":[187],"are":[188],"upper":[189],"bounds":[190],"cost;":[193],"proof":[195],"entirely":[197],"syntactic":[198],"therefore":[200],"applies":[201],"all":[203],"consider.":[208]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3}],"updated_date":"2026-04-11T08:14:18.477133","created_date":"2025-10-10T00:00:00"}
