{"id":"https://openalex.org/W2133147697","doi":"https://doi.org/10.1145/199448.199481","title":"Lower bounds on type inference with subtypes","display_name":"Lower bounds on type inference with subtypes","alternate_titles":[],"publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W2133147697","doi":"https://doi.org/10.1145/199448.199481","mag":"2133147697"},"language":"en","primary_location":{"id":"doi:10.1145/199448.199481","doi":"https://doi.org/10.1145/199448.199481","is_oa":false,"landing_page_url":"https://doi.org/10.1145/199448.199481","pdf_url":null,"source":{"id":"https://openalex.org/S7407088133","display_name":"ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '95","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2133147697"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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/A5062444453","display_name":"My Hoang","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"My Hoang","raw_affiliation_strings":["Computer Science Department, Stanford University, Stanford, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Stanford University, Stanford, CA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101897622","display_name":"John C. Mitchell","orcid":"https://orcid.org/0000-0002-0024-860X","observed_orcids":["https://orcid.org/0000-0002-0024-860X"]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John C. Mitchell","raw_affiliation_strings":["Computer Science Department, Stanford University, Stanford, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Stanford University, Stanford, CA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":5.9087,"has_fulltext":false,"cited_by_count":62,"citation_normalized_percentile":{"value":0.97431507,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":86,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"176","last_page":"185"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":1.0,"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"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.0,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.0,"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/type-inference","display_name":"type inference","score":0.9950000047683716},{"id":"https://openalex.org/keywords/subtyping","display_name":"subtyping","score":0.9409999847412109},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.7950000166893005},{"id":"https://openalex.org/keywords/pspace-hardness","display_name":"PSPACE-hardness","score":0.8149999976158142},{"id":"https://openalex.org/keywords/satisfiability","display_name":"satisfiability","score":0.8109999895095825},{"id":"https://openalex.org/keywords/principal-typing","display_name":"principal typing","score":0.8920000195503235},{"id":"https://openalex.org/keywords/lambda-calculus","display_name":"lambda calculus","score":0.6579999923706055},{"id":"https://openalex.org/keywords/type-declarations","display_name":"type declarations","score":0.5680000185966492},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.5239999890327454}],"concepts":[{"id":"https://openalex.org/C83852419","wikidata":"https://www.wikidata.org/wiki/Q2713292","display_name":"Subtyping","level":2,"score":0.6902951002120972},{"id":"https://openalex.org/C198370458","wikidata":"https://www.wikidata.org/wiki/Q586459","display_name":"Type inference","level":3,"score":0.6737451553344727},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.580974817276001},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.5368656516075134},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.524635374546051},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5104929208755493},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4995741844177246},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4832671284675598},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.46998512744903564},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.46843868494033813},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4597572982311249},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44879403710365295},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.4445478320121765},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4367937743663788},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43531864881515503},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.43202710151672363},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4132488965988159},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30376288294792175},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2808097302913666},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25643831491470337},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1566145122051239},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14675506949424744},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/199448.199481","doi":"https://doi.org/10.1145/199448.199481","is_oa":false,"landing_page_url":"https://doi.org/10.1145/199448.199481","pdf_url":null,"source":{"id":"https://openalex.org/S7407088133","display_name":"ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '95","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1484302646","https://openalex.org/W1491178396","https://openalex.org/W1506093933","https://openalex.org/W1562611359","https://openalex.org/W1703087989","https://openalex.org/W1964476601","https://openalex.org/W1969093922","https://openalex.org/W2012108763","https://openalex.org/W2020784851","https://openalex.org/W2051328776","https://openalex.org/W2062950667","https://openalex.org/W2151384546","https://openalex.org/W2293278021","https://openalex.org/W3163132554"],"related_works":["https://openalex.org/W7096464640","https://openalex.org/W2182341276","https://openalex.org/W7098663117","https://openalex.org/W1569918838","https://openalex.org/W2552165488","https://openalex.org/W1875836313","https://openalex.org/W2051328776","https://openalex.org/W2156211387","https://openalex.org/W3150212150","https://openalex.org/W2293278021"],"abstract_inverted_index":{"We":[0],"investigate":[1],"type":[2,17,148,160],"inference":[3,18,161],"for":[4,20,49],"programming":[5],"languages":[6],"with":[7],"subtypes.":[8],"As":[9],"described":[10],"in":[11,41,197,228],"previous":[12,115],"work,":[13],"there":[14,190],"are":[15,191],"several":[16,192],"problems":[19],"any":[21,50,156],"given":[22,155],"expression":[23],"language,":[24],"depending":[25],"on":[26,130],"the":[27,30,35,55,76,82,87,93,114,131,138,151,198,214,229,232],"form":[28,71,101],"of":[29,57,72,86,92,95,102,118,133,146,174,195,200,210,216,231],"subtype":[31,52,139],"partial":[32,53,78,109],"order":[33],"and":[34],"ability":[36],"to":[37,69,120,164,223],"define":[38],"new":[39],"subtypes":[40],"programs.":[42],"Our":[43,122,202],"first":[44,83],"main":[45,124],"result":[46,125,145],"is":[47,63,65,90,105,126,179,205],"that":[48,89,180,206],"specific":[51],"order,":[54],"problem":[56,74,88,104],"determining":[58],"whether":[59],"a":[60,70,127,144,159,166,175,221],"lambda":[61],"term":[62,222],"typable":[64],"algorithmically":[66],"(polynomial-time)":[67],"equivalent":[68],"satisfiability":[73,103],"over":[75,107],"same":[77],"order.":[79],"This":[80],"gives":[81],"exact":[84],"characterization":[85],"independent":[91],"syntax":[94],"expressions.":[96],"In":[97],"addition,":[98],"since":[99],"this":[100,111],"PSPACE-hard":[106],"certain":[108],"orders,":[110],"equivalence":[112],"strengthens":[113],"lower":[116,128,203],"bound":[117,129,204],"NP-hard":[119],"PSPACE-hard.":[121],"second":[123],"length":[132],"most":[134,167,176],"general":[135,168,177],"types":[136],"when":[137],"hierarchy":[140],"may":[141],"change":[142],"as":[143,187],"additional":[147,217],"declarations":[149],"within":[150],"program.":[152],"More":[153],"specifically,":[154],"input":[157],"expression,":[158],"algorithm":[162],"tries":[163],"find":[165],"(or":[169],"principal)":[170],"typing.":[171],"The":[172],"property":[173],"typing":[178],"it":[181],"has":[182],"all":[183],"other":[184],"possible":[185],"typings":[186],"instances.":[188],"However,":[189],"sound":[193,208],"notions":[194],"instance":[196,211],"presence":[199],"subtyping.":[201],"no":[207],"definition":[209],"would":[212],"allow":[213],"set":[215],"subtyping":[218],"hypotheses":[219],"about":[220],"grow":[224],"less":[225],"than":[226],"linearly":[227],"size":[230],"term.":[233]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2133147697","counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
