{"id":"https://openalex.org/W2094516550","doi":"https://doi.org/10.1145/158511.158700","title":"Efficient recursive subtyping","display_name":"Efficient recursive subtyping","publication_year":1993,"publication_date":"1993-01-01","ids":{"openalex":"https://openalex.org/W2094516550","doi":"https://doi.org/10.1145/158511.158700","mag":"2094516550"},"language":"en","primary_location":{"id":"doi:10.1145/158511.158700","doi":"https://doi.org/10.1145/158511.158700","is_oa":false,"landing_page_url":"https://doi.org/10.1145/158511.158700","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 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93","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/A5053923311","display_name":"Dexter C. Kozen","orcid":"https://orcid.org/0000-0002-8007-4725","observed_orcids":["https://orcid.org/0000-0002-8007-4725"]},"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":false,"raw_author_name":"Dexter Kozen","raw_affiliation_strings":["Cornell University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cornell University","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011356414","display_name":"Jens Palsberg","orcid":"https://orcid.org/0000-0003-4747-365X","observed_orcids":["https://orcid.org/0000-0003-4747-365X"]},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Jens Palsberg","raw_affiliation_strings":["[Aalborg university]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[Aalborg university]","institution_ids":["https://openalex.org/I891191580"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066751232","display_name":"Michael I. Schwartzbach","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Michael I. Schwartzbach","raw_affiliation_strings":["[Aalborg university]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[Aalborg university]","institution_ids":["https://openalex.org/I891191580"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.7631,"has_fulltext":false,"cited_by_count":58,"citation_normalized_percentile":{"value":0.96047989,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"419","last_page":"428"},"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.9945999979972839,"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":0.9945999979972839,"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.004999999888241291,"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":9.999999747378752e-05,"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/recursive-types","display_name":"recursive types","score":0.8410000205039978},{"id":"https://openalex.org/keywords/lambda-calculus","display_name":"lambda calculus","score":0.7170000076293945},{"id":"https://openalex.org/keywords/finite-state-machines","display_name":"finite automata","score":0.7200000286102295},{"id":"https://openalex.org/keywords/emptiness-problem","display_name":"emptiness problem","score":0.875},{"id":"https://openalex.org/keywords/quadratic-time-algorithm","display_name":"quadratic-time algorithm","score":0.6629999876022339},{"id":"https://openalex.org/keywords/type-equality","display_name":"type equality","score":0.6290000081062317},{"id":"https://openalex.org/keywords/decidability","display_name":"decidability","score":0.6029999852180481}],"concepts":[{"id":"https://openalex.org/C83852419","wikidata":"https://www.wikidata.org/wiki/Q2713292","display_name":"Subtyping","level":2,"score":0.9279855489730835},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6902563571929932},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4027985632419586}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/158511.158700","doi":"https://doi.org/10.1145/158511.158700","is_oa":false,"landing_page_url":"https://doi.org/10.1145/158511.158700","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 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/fe5dae40-bfe2-11de-82fe-000ea68e967b","doi":null,"is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/fe5dae40-bfe2-11de-82fe-000ea68e967b","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Schwartzbach, M I, Kozen, D & Palsberg, J 1993, Efficient Recursive Subtyping. in Proceedings of the 20th Annual Symposium on Principles of Programming Languages. Association for Computing Machinery, pp. 419-428, Annual Symposium on Principles of Programming Languages, Charleston, SC, United States, 17/12/2010. https://doi.org/10.1145/158511.158700","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1762668282","https://openalex.org/W1875836313","https://openalex.org/W1973576343","https://openalex.org/W2002089154","https://openalex.org/W2027657506","https://openalex.org/W2033084853","https://openalex.org/W2125048909","https://openalex.org/W2484298212"],"related_works":["https://openalex.org/W2182755748","https://openalex.org/W3007982376","https://openalex.org/W4406221852","https://openalex.org/W2123727486","https://openalex.org/W1544370566","https://openalex.org/W2122685887","https://openalex.org/W4407925464","https://openalex.org/W2069323522","https://openalex.org/W7099946681","https://openalex.org/W3106544059"],"abstract_inverted_index":{"Subtyping":[0],"in":[1,16,40],"the":[2,8,25,58,61,69,72,92,108],"presence":[3],"of":[4,27,36,57,60,88,102],"recursive":[5,31,89],"types":[6,90],"for":[7,75],"l-calculus":[9],"was":[10],"studied":[11],"by":[12,100],"Amadio":[13],"and":[14,91],"Cardelli":[15],"1991":[17],"[1].":[18],"In":[19],"that":[20,24,86],"paper":[21,44],"they":[22],"showed":[23],"problem":[26,70,74],"deciding":[28],"whether":[29],"one":[30],"type":[32],"is":[33,38,52,84],"a":[34,55,76],"sub-type":[35],"another":[37],"decidable":[39],"exponential":[41],"time.In":[42],"this":[43],"we":[45],"give":[46],"an":[47],"O(n2)":[48],"algorithm.":[49],"Our":[50,105],"algorithm":[51],"based":[53,114],"on":[54,115],"simplification":[56],"definition":[59],"subtype":[62],"relation,":[63],"which":[64],"allows":[65],"us":[66],"to":[67,71,111],"reduce":[68],"emptiness":[73],"certain":[77],"finite":[78,103],"automaton":[79],"with":[80],"quadratically":[81],"many":[82],"states.It":[83],"known":[85],"equality":[87],"covariant":[93],"Bo\u00a8hm":[94],"order":[95],"can":[96],"be":[97],"decided":[98],"efficiently":[99],"means":[101],"automata.":[104],"results":[106],"extend":[107],"automata-theoretic":[109],"approach":[110],"handle":[112],"orderings":[113],"contravariance.":[116]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2016-06-24T00:00:00"}