{"id":"https://openalex.org/W2900045822","doi":"https://doi.org/10.1145/3290328","title":"Gradual type theory","display_name":"Gradual type theory","publication_year":2019,"publication_date":"2019-01-02","ids":{"openalex":"https://openalex.org/W2900045822","doi":"https://doi.org/10.1145/3290328","mag":"2900045822"},"language":"en","primary_location":{"id":"doi:10.1145/3290328","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3290328","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3290328","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://dl.acm.org/doi/pdf/10.1145/3290328","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050680882","display_name":"Max S. New","orcid":"https://orcid.org/0000-0001-8141-195X"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Max S. New","raw_affiliation_strings":["Northeastern University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeastern University, USA","institution_ids":["https://openalex.org/I12912129"]}]},{"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"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Wesleyan University, USA","institution_ids":["https://openalex.org/I100538780"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084250644","display_name":"Amal Ahmed","orcid":"https://orcid.org/0000-0001-7424-572X"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR","US"],"is_corresponding":false,"raw_author_name":"Amal Ahmed","raw_affiliation_strings":["Northeastern University, USA / Inria, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeastern University, USA / Inria, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I12912129"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7353,"has_fulltext":true,"cited_by_count":24,"citation_normalized_percentile":{"value":0.88297408,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"3","issue":"POPL","first_page":"1","last_page":"31"},"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/T10260","display_name":"Software Engineering Research","score":0.9919000267982483,"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9847999811172485,"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/extensionality","display_name":"Extensionality","score":0.8036643266677856},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.7485924959182739},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6451489329338074},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.6275072693824768},{"id":"https://openalex.org/keywords/type-theory","display_name":"Type theory","score":0.607221782207489},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5625640153884888},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5220532417297363},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.508836567401886},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.5030226111412048},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.4198821187019348},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39472055435180664},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.3814105689525604},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3366815447807312},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.30221086740493774},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.2105610966682434}],"concepts":[{"id":"https://openalex.org/C150355047","wikidata":"https://www.wikidata.org/wiki/Q965432","display_name":"Extensionality","level":2,"score":0.8036643266677856},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.7485924959182739},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6451489329338074},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.6275072693824768},{"id":"https://openalex.org/C93682546","wikidata":"https://www.wikidata.org/wiki/Q1056428","display_name":"Type theory","level":3,"score":0.607221782207489},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5625640153884888},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5220532417297363},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.508836567401886},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.5030226111412048},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.4198821187019348},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39472055435180664},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.3814105689525604},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3366815447807312},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30221086740493774},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.2105610966682434},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3290328","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3290328","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3290328","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"}],"best_oa_location":{"id":"doi:10.1145/3290328","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3290328","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3290328","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/G6014218453","display_name":"CAREER: Verified Compilers for a Multi-Language World","funder_award_id":"1453796","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7090116110","display_name":null,"funder_award_id":"FA9550","funder_id":"https://openalex.org/F4320332467","funder_display_name":"U.S. Air Force"},{"id":"https://openalex.org/G7966295938","display_name":null,"funder_award_id":"FA9550-15-1-0053, FA9550-16-1-0292","funder_id":"https://openalex.org/F4320338294","funder_display_name":"Air Force Research Laboratory"},{"id":"https://openalex.org/G893490654","display_name":null,"funder_award_id":"CCF-1453796","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"},{"id":"https://openalex.org/F4320310207","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33"},{"id":"https://openalex.org/F4320332467","display_name":"U.S. Air Force","ror":"https://ror.org/006gmme17"},{"id":"https://openalex.org/F4320338294","display_name":"Air Force Research Laboratory","ror":"https://ror.org/02e2egq70"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2900045822.pdf","grobid_xml":"https://content.openalex.org/works/W2900045822.grobid-xml"},"referenced_works_count":47,"referenced_works":["https://openalex.org/W129833001","https://openalex.org/W142035240","https://openalex.org/W753900477","https://openalex.org/W776882319","https://openalex.org/W1480685649","https://openalex.org/W1493411447","https://openalex.org/W1496853143","https://openalex.org/W1508098446","https://openalex.org/W1544818949","https://openalex.org/W1614627710","https://openalex.org/W1625481196","https://openalex.org/W1996450703","https://openalex.org/W2003969655","https://openalex.org/W2023861274","https://openalex.org/W2027189949","https://openalex.org/W2034355944","https://openalex.org/W2052973434","https://openalex.org/W2059703978","https://openalex.org/W2073686054","https://openalex.org/W2085595534","https://openalex.org/W2100559921","https://openalex.org/W2112121519","https://openalex.org/W2128303158","https://openalex.org/W2133828278","https://openalex.org/W2139597778","https://openalex.org/W2145617779","https://openalex.org/W2150998213","https://openalex.org/W2169661165","https://openalex.org/W2184230987","https://openalex.org/W2284690928","https://openalex.org/W2295283668","https://openalex.org/W2296599395","https://openalex.org/W2460339236","https://openalex.org/W2561856298","https://openalex.org/W2566906701","https://openalex.org/W2736821074","https://openalex.org/W2753479937","https://openalex.org/W2767557842","https://openalex.org/W2796564118","https://openalex.org/W2806445177","https://openalex.org/W2886134830","https://openalex.org/W2886526538","https://openalex.org/W2900045822","https://openalex.org/W2949330042","https://openalex.org/W2963037676","https://openalex.org/W3137596000","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2290698615","https://openalex.org/W2964029175","https://openalex.org/W4388246805","https://openalex.org/W2787765784","https://openalex.org/W4299576734","https://openalex.org/W2963775463","https://openalex.org/W2432956223","https://openalex.org/W4205724670","https://openalex.org/W2557961224","https://openalex.org/W4297623348"],"abstract_inverted_index":{"Gradually":[0],"typed":[1,9,12,148],"languages":[2,29],"are":[3,203,210],"designed":[4],"to":[5,31,45,176],"support":[6],"both":[7,126],"dynamically":[8],"and":[10,59,78,128,144,217,282,293],"statically":[11],"programming":[13],"styles":[14],"while":[15],"preserving":[16],"the":[17,41,83,161,177,190,215,230,251,257,276,279,294],"benefits":[18],"of":[19,56,65,85,96,125,192,219,239,250,268,278,287],"each.":[20],"While":[21],"existing":[22],"gradual":[23,47,86,101,112,130,155,201,208,259,269,295],"type":[24,113,156,241],"soundness":[25],"theorems":[26,50,140],"for":[27,154,165],"these":[28,49],"aim":[30],"show":[32,158,199,214],"that":[33,54,141,159,171,185,200,225,289],"type-based":[34,57,291],"reasoning":[35,74],"is":[36,61,68,79,273],"preserved":[37],"when":[38],"moving":[39],"from":[40],"fully":[42],"static":[43],"setting":[44],"a":[46,100,108,166,226,235,285],"one,":[48],"do":[51],"not":[52],"imply":[53],"correctness":[55,64],"refactorings":[58,145],"optimizations":[60,143],"preserved.":[62],"Establishing":[63],"program":[66,76,97],"transformations":[67],"technically":[69],"difficult,":[70],"because":[71],"it":[72],"requires":[73],"about":[75],"equivalence,":[77],"often":[80],"neglected":[81],"in":[82,99,107,146,245],"metatheory":[84],"languages.":[87,131,149],"In":[88],"this":[89,183,265],"paper,":[90],"we":[91,105,110,137,198],"propose":[92],"an":[93,122],"axiomatic":[94,123,135,221],"account":[95,124,136],"equivalence":[98,244,249],"cast":[102,180,187,232],"calculus,":[103],"which":[104],"formalize":[106],"logic":[109],"call":[111],"theory":[114,222],"(GTT).":[115],"Based":[116,132],"on":[117,133],"Levy\u2019s":[118],"call-by-push-value,":[119],"GTT":[120,246,254],"gives":[121,234,284],"call-by-value":[127],"call-by-name":[129],"our":[134,220,240,261],"prove":[138],"many":[139],"justify":[142],"gradually":[147],"For":[150],"example,":[151,197],"uniqueness":[152],"principles":[153],"connectives":[157],"if":[160],"\u03b2\u03b7":[162],"laws":[163],"hold":[164],"connective,":[167],"then":[168],"casts":[169],"between":[170],"connective":[172],"must":[173],"be":[174],"equivalent":[175],"so-called":[178],"\u201clazy\u201d":[179],"semantics.":[181],"Contrapositively,":[182],"shows":[184],"\u201ceager\u201d":[186],"semantics":[188,233],"violates":[189],"extensionality":[191],"function":[193],"types.":[194],"As":[195],"another":[196],"upcasts":[202],"pure":[204],"functions":[205],"and,":[206],"dually,":[207],"downcasts":[209],"strict":[211],"functions.":[212],"We":[213],"consistency":[216],"applicability":[218],"by":[223,275],"proving":[224],"contract-based":[227],"implementation":[228,277],"using":[229],"lazy":[231],"logical":[236],"relations":[237],"model":[238,262,272],"theory,":[242],"where":[243],"implies":[247],"contextual":[248],"programs.":[252],"Since":[253],"also":[255,263],"axiomatizes":[256],"dynamic":[258,280],"guarantee,":[260],"establishes":[264],"central":[266],"theorem":[267],"typing.":[270],"The":[271],"parametrized":[274],"types,":[281],"so":[283],"family":[286],"implementations":[288],"validate":[290],"optimization":[292],"guarantee.":[296]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}