{"id":"https://openalex.org/W4387686502","doi":"https://doi.org/10.1145/3610612.3610622","title":"Closure Conversion in Little Pieces","display_name":"Closure Conversion in Little Pieces","publication_year":2023,"publication_date":"2023-10-16","ids":{"openalex":"https://openalex.org/W4387686502","doi":"https://doi.org/10.1145/3610612.3610622"},"language":"en","primary_location":{"id":"doi:10.1145/3610612.3610622","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3610612.3610622","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium on Principles and Practice of Declarative 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/A5076947509","display_name":"Zachary Sullivan","orcid":"https://orcid.org/0000-0003-3023-1996"},"institutions":[{"id":"https://openalex.org/I181233156","display_name":"University of Oregon","ror":"https://ror.org/0293rh119","country_code":"US","type":"education","lineage":["https://openalex.org/I181233156"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zachary J. Sullivan","raw_affiliation_strings":["University of Oregon, USA"],"raw_orcid":"https://orcid.org/0000-0003-3023-1996","affiliations":[{"raw_affiliation_string":"University of Oregon, USA","institution_ids":["https://openalex.org/I181233156"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020454182","display_name":"Paul Downen","orcid":"https://orcid.org/0000-0003-0165-9387"},"institutions":[{"id":"https://openalex.org/I133738476","display_name":"University of Massachusetts Lowell","ror":"https://ror.org/03hamhx47","country_code":"US","type":"education","lineage":["https://openalex.org/I133738476"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Paul Downen","raw_affiliation_strings":["University of Massachusetts at Lowell, USA"],"raw_orcid":"https://orcid.org/0000-0003-0165-9387","affiliations":[{"raw_affiliation_string":"University of Massachusetts at Lowell, USA","institution_ids":["https://openalex.org/I133738476"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064696313","display_name":"Zena M. Ariola","orcid":"https://orcid.org/0000-0001-5551-8294"},"institutions":[{"id":"https://openalex.org/I181233156","display_name":"University of Oregon","ror":"https://ror.org/0293rh119","country_code":"US","type":"education","lineage":["https://openalex.org/I181233156"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zena M. Ariola","raw_affiliation_strings":["University of Oregon, USA"],"raw_orcid":"https://orcid.org/0000-0001-5551-8294","affiliations":[{"raw_affiliation_string":"University of Oregon, USA","institution_ids":["https://openalex.org/I181233156"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6526,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.75541242,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"13"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.994700014591217,"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/correctness","display_name":"Correctness","score":0.8327658176422119},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7629849910736084},{"id":"https://openalex.org/keywords/transformation","display_name":"Transformation (genetics)","score":0.7034334540367126},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.6909345388412476},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.617780864238739},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5411196947097778},{"id":"https://openalex.org/keywords/program-transformation","display_name":"Program transformation","score":0.48466354608535767},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33479565382003784},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3285885453224182}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.8327658176422119},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7629849910736084},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.7034334540367126},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.6909345388412476},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.617780864238739},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5411196947097778},{"id":"https://openalex.org/C2778361913","wikidata":"https://www.wikidata.org/wiki/Q7248437","display_name":"Program transformation","level":2,"score":0.48466354608535767},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33479565382003784},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3285885453224182},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3610612.3610622","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3610612.3610622","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium on Principles and Practice of Declarative Programming","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1580664042","https://openalex.org/W1991685539","https://openalex.org/W2005958145","https://openalex.org/W2030663607","https://openalex.org/W2040871029","https://openalex.org/W2059416532","https://openalex.org/W2062838731","https://openalex.org/W2073904768","https://openalex.org/W2097166325","https://openalex.org/W2103859677","https://openalex.org/W2149412346","https://openalex.org/W2964769002","https://openalex.org/W3147781287","https://openalex.org/W4242150334"],"related_works":["https://openalex.org/W2009332552","https://openalex.org/W58529227","https://openalex.org/W2066868279","https://openalex.org/W2755827507","https://openalex.org/W114260088","https://openalex.org/W2158595452","https://openalex.org/W60573678","https://openalex.org/W2364065203","https://openalex.org/W1509231339","https://openalex.org/W1532167182"],"abstract_inverted_index":{"Closure":[0],"conversion,":[1,41,58,78],"an":[2],"essential":[3],"step":[4],"in":[5,45,85],"compiling":[6],"functional":[7],"programs,":[8],"is":[9],"traditionally":[10],"presented":[11],"as":[12],"a":[13,17,53,86],"global":[14],"transformation":[15,27,65],"from":[16],"language":[18,48,89],"with":[19,37,102],"higher-order":[20],"functions":[21],"to":[22],"one":[23],"without.":[24],"Optimizing":[25],"this":[26],"can":[28],"be":[29,44,61,81],"done":[30],"at":[31,49,67],"any":[32],"of":[33,52,70,95,111],"its":[34,72],"three":[35],"stages":[36],"various":[38],"tradeoffs.":[39],"After":[40],"optimizations":[42,59,79],"will":[43,107],"the":[46,50,64,68,93,96,103,109,112],"target":[47],"cost":[51,69],"weaker":[54],"equational":[55],"theory.":[56],"During":[57],"may":[60,80],"embedded":[62],"into":[63],"itself":[66],"increasing":[71],"complexity":[73],"and":[74,83],"correctness.":[75],"And":[76],"before":[77],"planned":[82],"anticipated":[84],"specialized":[87],"intermediate":[88],"(IL)":[90],"where":[91],"all":[92],"properties":[94],"source":[97],"program":[98],"are":[99],"still":[100],"known,":[101],"hope":[104],"that":[105],"they":[106],"survive":[108],"rest":[110],"compilation":[113],"process.":[114]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}