{"id":"https://openalex.org/W4401603071","doi":"https://doi.org/10.1145/3674648","title":"Closure-Free Functional Programming in a Two-Level Type Theory","display_name":"Closure-Free Functional Programming in a Two-Level Type Theory","publication_year":2024,"publication_date":"2024-08-15","ids":{"openalex":"https://openalex.org/W4401603071","doi":"https://doi.org/10.1145/3674648"},"language":"en","primary_location":{"id":"doi:10.1145/3674648","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3674648","pdf_url":null,"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":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1145/3674648","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045224632","display_name":"Andr\u00e1s Kov\u00e1cs","orcid":"https://orcid.org/0000-0002-6375-9781"},"institutions":[{"id":"https://openalex.org/I881427289","display_name":"University of Gothenburg","ror":"https://ror.org/01tm6cn81","country_code":"SE","type":"education","lineage":["https://openalex.org/I881427289"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Andr\u00e1s Kov\u00e1cs","raw_affiliation_strings":["University of Gothenburg, Gothenburg, Sweden"],"raw_orcid":"https://orcid.org/0000-0002-6375-9781","affiliations":[{"raw_affiliation_string":"University of Gothenburg, Gothenburg, Sweden","institution_ids":["https://openalex.org/I881427289"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5045224632"],"corresponding_institution_ids":["https://openalex.org/I881427289"],"apc_list":null,"apc_paid":null,"fwci":1.6671,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.86186099,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"8","issue":"ICFP","first_page":"659","last_page":"692"},"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.9944000244140625,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9837999939918518,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/closure","display_name":"Closure (psychology)","score":0.8474675416946411},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.45082589983940125},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39855092763900757},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3469359874725342},{"id":"https://openalex.org/keywords/geology","display_name":"Geology","score":0.1433613896369934},{"id":"https://openalex.org/keywords/political-science","display_name":"Political science","score":0.13905131816864014}],"concepts":[{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.8474675416946411},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.45082589983940125},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39855092763900757},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3469359874725342},{"id":"https://openalex.org/C127313418","wikidata":"https://www.wikidata.org/wiki/Q1069","display_name":"Geology","level":0,"score":0.1433613896369934},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.13905131816864014},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3674648","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3674648","pdf_url":null,"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:research.chalmers.se:543356","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/543356","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null}],"best_oa_location":{"id":"doi:10.1145/3674648","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3674648","pdf_url":null,"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/G6499718023","display_name":null,"funder_award_id":"2019.0116","funder_id":"https://openalex.org/F4320322327","funder_display_name":"Knut och Alice Wallenbergs Stiftelse"}],"funders":[{"id":"https://openalex.org/F4320322327","display_name":"Knut och Alice Wallenbergs Stiftelse","ror":"https://ror.org/004hzzk67"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W1494555245","https://openalex.org/W1512931629","https://openalex.org/W1545172682","https://openalex.org/W1545449210","https://openalex.org/W1556604985","https://openalex.org/W1608933122","https://openalex.org/W1821509023","https://openalex.org/W1974190112","https://openalex.org/W1990204174","https://openalex.org/W2014995396","https://openalex.org/W2020217406","https://openalex.org/W2036753530","https://openalex.org/W2059895047","https://openalex.org/W2073904768","https://openalex.org/W2083044913","https://openalex.org/W2094455839","https://openalex.org/W2117161590","https://openalex.org/W2127114597","https://openalex.org/W2139626883","https://openalex.org/W2141576692","https://openalex.org/W2147578933","https://openalex.org/W2156285626","https://openalex.org/W2160249850","https://openalex.org/W2188944230","https://openalex.org/W2562114628","https://openalex.org/W2562640456","https://openalex.org/W2565502105","https://openalex.org/W2761967104","https://openalex.org/W2794030829","https://openalex.org/W2905603442","https://openalex.org/W2921453367","https://openalex.org/W3046312033","https://openalex.org/W3188022539","https://openalex.org/W4205167460","https://openalex.org/W4213279211","https://openalex.org/W4235947164","https://openalex.org/W4248334436","https://openalex.org/W4293813091","https://openalex.org/W4321470848","https://openalex.org/W4390739053","https://openalex.org/W6931468572","https://openalex.org/W6949102442"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2600246793"],"abstract_inverted_index":{"Many":[0],"abstraction":[1,60,94,143],"tools":[2],"in":[3,28,123],"functional":[4],"programming":[5],"rely":[6],"heavily":[7],"on":[8],"general-purpose":[9,56],"compiler":[10,77],"optimization":[11,57],"to":[12,84,175],"achieve":[13],"adequate":[14],"performance.":[15,40],"For":[16],"example,":[17],"monadic":[18],"binding":[19],"is":[20,51,99,114],"a":[21,81,100,115,124,177,181,193],"higher-order":[22],"function":[23],"which":[24,104],"yields":[25],"runtime":[26,109],"closures":[27],"the":[29,46,133,157],"absence":[30],"of":[31,132,172,180,198],"sufficient":[32],"compile-time":[33,112],"inlining":[34,74],"and":[35,62,67,76,92,139,149,192],"beta-reductions,":[36],"thereby":[37],"significantly":[38],"degrading":[39],"In":[41],"current":[42],"systems":[43],"such":[44],"as":[45],"Glasgow":[47],"Haskell":[48,159,196],"Compiler,":[49],"there":[50],"no":[52],"strong":[53,87,93],"guarantee":[54],"that":[55],"can":[58,105,151],"eliminate":[59],"overheads,":[61],"users":[63],"only":[64],"have":[65],"indirect":[66],"fragile":[68],"control":[69],"over":[70],"code":[71,90],"generation":[72,91],"through":[73],"directives":[75],"options.":[78],"We":[79,128,187],"propose":[80],"two-stage":[82],"language":[83,98,103,113],"simultaneously":[85],"get":[86],"guarantees":[88],"about":[89],"features.":[95],"The":[96,111,119],"object":[97],"simply-typed":[101],"first-order":[102],"be":[106],"compiled":[107],"without":[108],"closures.":[110],"dependent":[116,173],"type":[117,126],"theory.":[118,127],"two":[120,130],"are":[121,145],"integrated":[122],"two-level":[125],"demonstrate":[129],"applications":[131],"system.":[134],"First,":[135],"we":[136,150,162,168],"develop":[137,163],"monads":[138],"monad":[140],"transformers.":[141],"Here,":[142],"overheads":[144],"eliminated":[146],"by":[147],"staging":[148],"reuse":[152],"almost":[153],"all":[154],"definitions":[155],"from":[156],"existing":[158],"ecosystem.":[160],"Second,":[161],"pull-based":[164],"stream":[165],"fusion.":[166,186],"Here":[167],"make":[169],"essential":[170],"use":[171],"types":[174],"give":[176],"concise":[178],"definition":[179],"concatMap":[182],"operation":[183],"with":[184],"guaranteed":[185],"provide":[188],"an":[189],"Agda":[190],"implementation":[191,197],"typed":[194],"Template":[195],"these":[199],"developments.":[200]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}