{"id":"https://openalex.org/W2070417153","doi":"https://doi.org/10.1016/s1571-0661(05)80702-9","title":"Typed Closure Conversion for Recursively-Defined Functions","display_name":"Typed Closure Conversion for Recursively-Defined Functions","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W2070417153","doi":"https://doi.org/10.1016/s1571-0661(05)80702-9","mag":"2070417153"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(05)80702-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80702-9","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(05)80702-9","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5064972235","display_name":"Greg Morrisett","orcid":null},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Greg Morrisett","raw_affiliation_strings":["Cornell University"],"affiliations":[{"raw_affiliation_string":"Cornell University","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028720578","display_name":"Robert Harper","orcid":"https://orcid.org/0000-0002-9400-2941"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert Harper","raw_affiliation_strings":["Carnegie Mellon University"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5064972235"],"corresponding_institution_ids":["https://openalex.org/I205783295"],"apc_list":null,"apc_paid":null,"fwci":2.1409,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.89161757,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"10","issue":null,"first_page":"230","last_page":"241"},"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.9997000098228455,"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.9997000098228455,"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.9911999702453613,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9843999743461609,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.8095797300338745},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.7581570148468018},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.695792019367218},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6941601037979126},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.6833740472793579},{"id":"https://openalex.org/keywords/sketch","display_name":"Sketch","score":0.5664523243904114},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.56513911485672},{"id":"https://openalex.org/keywords/transformation","display_name":"Transformation (genetics)","score":0.5065284967422485},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4858553111553192},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.43839845061302185},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4197729229927063},{"id":"https://openalex.org/keywords/program-transformation","display_name":"Program transformation","score":0.4145240783691406},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38355451822280884},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17782831192016602}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8095797300338745},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7581570148468018},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.695792019367218},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6941601037979126},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.6833740472793579},{"id":"https://openalex.org/C2779231336","wikidata":"https://www.wikidata.org/wiki/Q7534724","display_name":"Sketch","level":2,"score":0.5664523243904114},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.56513911485672},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.5065284967422485},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4858553111553192},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.43839845061302185},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4197729229927063},{"id":"https://openalex.org/C2778361913","wikidata":"https://www.wikidata.org/wiki/Q7248437","display_name":"Program transformation","level":2,"score":0.4145240783691406},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38355451822280884},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17782831192016602},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","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":1,"locations":[{"id":"doi:10.1016/s1571-0661(05)80702-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80702-9","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(05)80702-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80702-9","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1580664042","https://openalex.org/W1584951182","https://openalex.org/W1793987241","https://openalex.org/W1979240050","https://openalex.org/W2060852846","https://openalex.org/W2062233055","https://openalex.org/W2078944436","https://openalex.org/W2079843645","https://openalex.org/W2090959968","https://openalex.org/W2104204098","https://openalex.org/W2118227920","https://openalex.org/W6635251283","https://openalex.org/W6638277885","https://openalex.org/W6644716136","https://openalex.org/W6673267551","https://openalex.org/W6677754795"],"related_works":["https://openalex.org/W2002505081","https://openalex.org/W2083681681","https://openalex.org/W2577630842","https://openalex.org/W3146558274","https://openalex.org/W1172579163","https://openalex.org/W1488300410","https://openalex.org/W2138790427","https://openalex.org/W4246454774","https://openalex.org/W2162051035","https://openalex.org/W1597127505"],"abstract_inverted_index":{"Much":[0],"recent":[1],"work":[2,69],"on":[3,14,116,123,131,149],"the":[4,15,29,34,40,50,81,92,150],"compilation":[5],"of":[6,17,33,44,83,94,152],"statically":[7],"typed":[8,64],"languages":[9],"such":[10,103],"as":[11,60,104],"ML":[12],"relies":[13],"propagation":[16],"type":[18],"information":[19],"from":[20],"source":[21],"to":[22,27,38,98],"object":[23],"code":[24,119],"in":[25,107],"order":[26],"increase":[28],"reliability":[30],"and":[31,37,42,86,128,139,141],"maintainabilty":[32],"compiler":[35,56,76],"itself":[36],"improve":[39],"efficiency":[41],"verifiability":[43],"generated":[45],"code.":[46],"To":[47],"achieve":[48],"this":[49],"program":[51],"transformations":[52,147],"performed":[53],"by":[54],"a":[55,117,124],"must":[57],"be":[58],"cast":[59],"type-preserving":[61],"translations":[62],"between":[63],"intermediate":[65],"languages.":[66],"In":[67],"earlier":[68],"with":[70],"Minamide":[71],"we":[72,90],"studied":[73],"one":[74,114,121,129],"important":[75],"transformation,":[77],"closure":[78,96],"conversion,":[79],"for":[80,100,145],"case":[82],"pure":[84],"simply-typed":[85,95],"polymorphic":[87],"\u03bb-calculus.":[88],"Here":[89],"extend":[91],"treatment":[93],"conversion":[97],"account":[99],"recursively-defined":[101],"functions":[102],"are":[105],"found":[106],"ML.":[108],"We":[109,134],"consider":[110],"three":[111],"main":[112],"approaches,":[113],"based":[115,122,130,148],"recursive":[118,132],"construct,":[120],"self-referential":[125],"data":[126],"structure,":[127],"types.":[133],"discuss":[135],"their":[136],"relative":[137],"advantages":[138],"disadvantages,":[140],"sketch":[142],"correctness":[143],"proofs":[144],"these":[146],"method":[151],"logical":[153],"relations.":[154]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}