{"id":"https://openalex.org/W2106142143","doi":"https://doi.org/10.1017/s0956796812000032","title":"Semantic subtyping with an SMT solver","display_name":"Semantic subtyping with an SMT solver","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2106142143","doi":"https://doi.org/10.1017/s0956796812000032","mag":"2106142143"},"language":"en","primary_location":{"id":"doi:10.1017/s0956796812000032","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796812000032","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/5093B3D8253A1A47E50357AFC7A321EF/S0956796812000032a.pdf/div-class-title-semantic-subtyping-with-an-smt-solver-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/5093B3D8253A1A47E50357AFC7A321EF/S0956796812000032a.pdf/div-class-title-semantic-subtyping-with-an-smt-solver-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077695892","display_name":"Gavin Bierman","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB","US"],"is_corresponding":false,"raw_author_name":"GAVIN M. BIERMAN","raw_affiliation_strings":["Microsoft Research, Cambridge, UK (e-mail:","Microsoft research, cambridge, uk (e-mail: gmb@microsoft.com, adg@microsoft.com)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Cambridge, UK (e-mail:","institution_ids":["https://openalex.org/I4210164937"]},{"raw_affiliation_string":"Microsoft research, cambridge, uk (e-mail: gmb@microsoft.com, adg@microsoft.com)#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078684560","display_name":"Andrew D. Gordon","orcid":"https://orcid.org/0000-0002-5809-2484"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB","US"],"is_corresponding":false,"raw_author_name":"ANDREW D. GORDON","raw_affiliation_strings":["Microsoft Research, Cambridge, UK (e-mail:","Microsoft research, cambridge, uk (e-mail: gmb@microsoft.com, adg@microsoft.com)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Cambridge, UK (e-mail:","institution_ids":["https://openalex.org/I4210164937"]},{"raw_affiliation_string":"Microsoft research, cambridge, uk (e-mail: gmb@microsoft.com, adg@microsoft.com)#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5106466226","display_name":"C\u0103t\u0103lin Hri\u0163cu","orcid":"https://orcid.org/0000-0001-8919-8081"},"institutions":[{"id":"https://openalex.org/I4210127693","display_name":"Penn Center for AIDS Research","ror":"https://ror.org/047939x15","country_code":"US","type":"facility","lineage":["https://openalex.org/I102322052","https://openalex.org/I1335321130","https://openalex.org/I4210127693","https://openalex.org/I79576946"]},{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]},{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE","US"],"is_corresponding":false,"raw_author_name":"C\u0102T\u0102LIN HRI\u0162CU","raw_affiliation_strings":["Saarland University and University of Pennyslvania, Philadelphia, PA, USA (e-mail:","Saarland university and university of pennyslvania, philadelphia, pa, usa (e-mail: catalin.hritcu@gmail.com)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saarland University and University of Pennyslvania, Philadelphia, PA, USA (e-mail:","institution_ids":["https://openalex.org/I4210127693","https://openalex.org/I79576946"]},{"raw_affiliation_string":"Saarland university and university of pennyslvania, philadelphia, pa, usa (e-mail: catalin.hritcu@gmail.com)#TAB#","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049576347","display_name":"David E. Langworthy","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"DAVID LANGWORTHY","raw_affiliation_strings":["Microsoft Corporation, Redmond, WA (e-mail:","Microsoft corporation, redmond, wa (e-mail: dlan@microsoft.com)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Corporation, Redmond, WA (e-mail:","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Microsoft corporation, redmond, wa (e-mail: dlan@microsoft.com)#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.0708,"has_fulltext":true,"cited_by_count":21,"citation_normalized_percentile":{"value":0.95127058,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"22","issue":"1","first_page":"31","last_page":"105"},"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.9998000264167786,"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.9998000264167786,"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.9997000098228455,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9991000294685364,"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/subtyping","display_name":"Subtyping","score":0.7234394550323486},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7231678366661072},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6445502638816833},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.4667530357837677},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.46587109565734863},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46413013339042664},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.45772111415863037},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.43231332302093506},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.42989516258239746},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.4279835820198059},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35687753558158875},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2922401428222656},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24945369362831116}],"concepts":[{"id":"https://openalex.org/C83852419","wikidata":"https://www.wikidata.org/wiki/Q2713292","display_name":"Subtyping","level":2,"score":0.7234394550323486},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7231678366661072},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6445502638816833},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.4667530357837677},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.46587109565734863},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46413013339042664},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.45772111415863037},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.43231332302093506},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.42989516258239746},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.4279835820198059},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35687753558158875},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2922401428222656},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24945369362831116},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0956796812000032","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796812000032","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/5093B3D8253A1A47E50357AFC7A321EF/S0956796812000032a.pdf/div-class-title-semantic-subtyping-with-an-smt-solver-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1017/s0956796812000032","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796812000032","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/5093B3D8253A1A47E50357AFC7A321EF/S0956796812000032a.pdf/div-class-title-semantic-subtyping-with-an-smt-solver-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2106142143.pdf","grobid_xml":"https://content.openalex.org/works/W2106142143.grobid-xml"},"referenced_works_count":48,"referenced_works":["https://openalex.org/W78483413","https://openalex.org/W92576581","https://openalex.org/W131990850","https://openalex.org/W605212316","https://openalex.org/W1522271721","https://openalex.org/W1525471810","https://openalex.org/W1553136405","https://openalex.org/W1555946950","https://openalex.org/W1557561422","https://openalex.org/W1577159241","https://openalex.org/W1922832738","https://openalex.org/W1966814918","https://openalex.org/W1970495662","https://openalex.org/W1975799355","https://openalex.org/W1979623128","https://openalex.org/W1980939032","https://openalex.org/W1988897846","https://openalex.org/W2000178662","https://openalex.org/W2036414952","https://openalex.org/W2036676170","https://openalex.org/W2038977978","https://openalex.org/W2055477538","https://openalex.org/W2055886480","https://openalex.org/W2063727779","https://openalex.org/W2078944436","https://openalex.org/W2096001571","https://openalex.org/W2097959001","https://openalex.org/W2101512909","https://openalex.org/W2105315191","https://openalex.org/W2122408999","https://openalex.org/W2123640792","https://openalex.org/W2130872776","https://openalex.org/W2135322712","https://openalex.org/W2136451095","https://openalex.org/W2144160229","https://openalex.org/W2146306932","https://openalex.org/W2318940639","https://openalex.org/W2609543277","https://openalex.org/W2612638105","https://openalex.org/W2912817377","https://openalex.org/W2914461853","https://openalex.org/W2916441570","https://openalex.org/W2918060308","https://openalex.org/W4241202945","https://openalex.org/W4242219660","https://openalex.org/W4245875875","https://openalex.org/W4247640335","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1868334863","https://openalex.org/W2401079607","https://openalex.org/W2141151670","https://openalex.org/W4241145878","https://openalex.org/W2761874473","https://openalex.org/W4384573318","https://openalex.org/W2735287568","https://openalex.org/W2652810043","https://openalex.org/W2238963713","https://openalex.org/W1815155750"],"abstract_inverted_index":{"Abstract":[0],"We":[1,65],"study":[2],"a":[3,20,24,34,38,45,67,98,113,136,147],"first-order":[4,79,106],"functional":[5],"language":[6],"with":[7],"the":[8,12,89,156],"novel":[9,114],"combination":[10],"of":[11,14,19,48,91,158,176],"ideas":[13],"refinement":[15],"type":[16,21],"(the":[17],"subset":[18],"to":[22,37,118,124,133,141,154],"satisfy":[23],"Boolean":[25,30],"expression)":[26],"and":[27,59,74,123,173,179],"type-test":[28],"(a":[29],"expression":[31],"testing":[32],"whether":[33],"value":[35],"belongs":[36],"type).":[39],"Our":[40],"core":[41],"calculus":[42],"can":[43],"express":[44],"rich":[46],"variety":[47],"typing":[49],"idioms;":[50],"for":[51,161],"example,":[52],"intersection,":[53],"union,":[54],"negation,":[55],"singleton,":[56],"nullable,":[57],"variant,":[58],"algebraic":[60],"types":[61,75,177],"are":[62,76,95],"all":[63],"derivable.":[64],"formulate":[66],"semantics":[68,90],"in":[69,97],"which":[70],"expressions":[71],"denote":[72],"terms,":[73],"interpreted":[77,96],"as":[78,85],"logic":[80],"formulas.":[81],"Subtyping":[82],"is":[83,132],"defined":[84],"valid":[86],"implication":[87],"between":[88],"types.":[92],"The":[93,129],"formulas":[94],"specific":[99],"model":[100],"that":[101],"we":[102,111],"axiomatize":[103],"using":[104,146],"standard":[105],"theories.":[107],"On":[108],"this":[109],"basis,":[110],"present":[112],"type-checking":[115,168],"algorithm":[116],"able":[117],"eliminate":[119],"many":[120,126],"dynamic":[121],"tests":[122],"detect":[125,170],"errors":[127],"statically.":[128],"key":[130],"idea":[131],"rely":[134],"on":[135],"Satisfiability":[137],"Modulo":[138],"Theories":[139],"solver":[140,151],"compute":[142,174],"subtyping":[143],"efficiently.":[144],"Moreover,":[145],"satisfiability":[148],"modulo":[149],"theories":[150],"allows":[152],"us":[153],"show":[155],"uniqueness":[157],"normal":[159],"forms":[160],"non-deterministic":[162],"expressions,":[163],"provide":[164],"precise":[165],"counterexamples":[166],"when":[167],"fails,":[169],"empty":[171],"types,":[172],"instances":[175],"statically":[178],"at":[180],"run-time.":[181]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}