{"id":"https://openalex.org/W2001507716","doi":"https://doi.org/10.1145/318593.318603","title":"Declaration-free type checking","display_name":"Declaration-free type checking","publication_year":1985,"publication_date":"1985-01-01","ids":{"openalex":"https://openalex.org/W2001507716","doi":"https://doi.org/10.1145/318593.318603","mag":"2001507716"},"language":"en","primary_location":{"id":"doi:10.1145/318593.318603","doi":"https://doi.org/10.1145/318593.318603","is_oa":false,"landing_page_url":"https://doi.org/10.1145/318593.318603","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":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '85","raw_type":"proceedings-article"},"volume":null,"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/A5101401651","display_name":"Prateek Mishra","orcid":"https://orcid.org/0000-0002-3262-1173","observed_orcids":["https://orcid.org/0000-0002-3262-1173"]},"institutions":[{"id":"https://openalex.org/I223532165","display_name":"University of Utah","ror":"https://ror.org/03r0ha626","country_code":"US","type":"education","lineage":["https://openalex.org/I223532165"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Prateek Mishra","raw_affiliation_strings":["University of Utah"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Utah","institution_ids":["https://openalex.org/I223532165"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109514602","display_name":"Uday S. Reddy","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I223532165","display_name":"University of Utah","ror":"https://ror.org/03r0ha626","country_code":"US","type":"education","lineage":["https://openalex.org/I223532165"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Uday S. Reddy","raw_affiliation_strings":["University of Utah"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Utah","institution_ids":["https://openalex.org/I223532165"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I223532165"],"apc_list":null,"apc_paid":null,"fwci":0.8087,"has_fulltext":false,"cited_by_count":79,"citation_normalized_percentile":{"value":0.62909836,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"7","last_page":"21"},"is_retracted":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/T10142","display_name":"Formal Methods in Verification","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.6790000200271606},{"id":"https://openalex.org/keywords/abstract-data-types","display_name":"abstract data types","score":0.8600000143051147},{"id":"https://openalex.org/keywords/regular-trees","display_name":"regular trees","score":0.7720000147819519},{"id":"https://openalex.org/keywords/regular-expressions","display_name":"regular expressions","score":0.5400000214576721},{"id":"https://openalex.org/keywords/recursive-data-structures","display_name":"recursive data structures","score":0.7950000166893005}],"concepts":[{"id":"https://openalex.org/C198370458","wikidata":"https://www.wikidata.org/wiki/Q586459","display_name":"Type inference","level":3,"score":0.8085637092590332},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7241088151931763},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7063358426094055},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.6990740895271301},{"id":"https://openalex.org/C138958017","wikidata":"https://www.wikidata.org/wiki/Q190087","display_name":"Data type","level":2,"score":0.6310595273971558},{"id":"https://openalex.org/C2778514511","wikidata":"https://www.wikidata.org/wiki/Q1374194","display_name":"Programmer","level":2,"score":0.5884178280830383},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.5720304250717163},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5287282466888428},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.5157464146614075},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4729808568954468},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.449836790561676},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4441409409046173},{"id":"https://openalex.org/C175971053","wikidata":"https://www.wikidata.org/wiki/Q827335","display_name":"Abstract data type","level":2,"score":0.4418562054634094},{"id":"https://openalex.org/C93682546","wikidata":"https://www.wikidata.org/wiki/Q1056428","display_name":"Type theory","level":3,"score":0.42120373249053955},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.3434827923774719},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.25974130630493164},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2478826940059662},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2372097373008728},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08814424276351929},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/318593.318603","doi":"https://doi.org/10.1145/318593.318603","is_oa":false,"landing_page_url":"https://doi.org/10.1145/318593.318603","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":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '85","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W92963751","https://openalex.org/W171682210","https://openalex.org/W1581551064","https://openalex.org/W1586338668","https://openalex.org/W1840229591","https://openalex.org/W1969093922","https://openalex.org/W2004419599","https://openalex.org/W2010152469","https://openalex.org/W2094945667","https://openalex.org/W2109342177","https://openalex.org/W2154632906","https://openalex.org/W2161122997","https://openalex.org/W2163976959","https://openalex.org/W2166822586","https://openalex.org/W2686043342"],"related_works":["https://openalex.org/W4245055891","https://openalex.org/W2170347514","https://openalex.org/W1499811390","https://openalex.org/W1967314639","https://openalex.org/W1983521033","https://openalex.org/W7096045061","https://openalex.org/W7099663113","https://openalex.org/W2055065270","https://openalex.org/W7095371613","https://openalex.org/W2588448678"],"abstract_inverted_index":{"Conventional":[0],"Milner-style":[1],"polymorphic":[2],"type":[3,35,47,57,112,115,121],"checkers":[4],"automatically":[5,53],"infer":[6],"types":[7,64,85],"of":[8,18,67,72,78,83,91],"functions":[9,118],"and":[10,49,114],"simple":[11],"composite":[12],"objects":[13],"such":[14,63,104],"as":[15],"tuples.":[16],"Types":[17],"recursive":[19],"data":[20,34,44],"structures":[21],"(e.g.":[22],"lists)":[23],"have":[24],"to":[25,75,88,102],"be":[26,52,120],"defined":[27],"by":[28,55],"the":[29,89],"programmer":[30],"through":[31],"an":[32],"abstract":[33,43],"definition.":[36],"In":[37],"this":[38],"paper,":[39],"we":[40],"show":[41],"how":[42],"types,":[45],"involving":[46],"union":[48],"recursion,":[50],"can":[51,119],"inferred":[54],"a":[56,70],"checker.":[58],"The":[59],"language":[60],"for":[61,117],"describing":[62],"is":[65,86],"that":[66],"regular":[68,73,97],"trees,":[69],"generalization":[71],"expressions":[74],"denote":[76],"sets":[77],"tree":[79],"structured":[80],"terms.":[81],"Inference":[82],"these":[84,107],"reducible":[87],"problem":[90],"solving":[92],"simultaneous":[93],"inclusion":[94],"inequations":[95],"over":[96],"trees.":[98],"We":[99],"present":[100],"algorithms":[101],"solve":[103],"inequations.":[105],"Using":[106],"techniques,":[108],"programs":[109],"without":[110],"any":[111],"definitions":[113],"annotations":[116],"checked.":[122]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-11-03T10:50:19.383937","created_date":"2016-06-24T00:00:00"}