{"id":"https://openalex.org/W2346985033","doi":"https://doi.org/10.1145/2933575.2934527","title":"The Diagonal Problem for Higher-Order Recursion Schemes is Decidable","display_name":"The Diagonal Problem for Higher-Order Recursion Schemes is Decidable","publication_year":2016,"publication_date":"2016-07-05","ids":{"openalex":"https://openalex.org/W2346985033","doi":"https://doi.org/10.1145/2933575.2934527","mag":"2346985033"},"language":"en","primary_location":{"id":"doi:10.1145/2933575.2934527","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2933575.2934527","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-01394830","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074542253","display_name":"Lorenzo Clemente","orcid":"https://orcid.org/0000-0003-0578-9103"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Lorenzo Clemente","raw_affiliation_strings":["University of Warsaw, Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085631393","display_name":"Pawe\u0142 Parys","orcid":"https://orcid.org/0000-0001-7247-1408"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Pawe\u0142 Parys","raw_affiliation_strings":["University of Warsaw, Warsaw, Poland","Faculty of Mathematics, Informatics, and Mechanics [Warsaw]"],"affiliations":[{"raw_affiliation_string":"University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"Faculty of Mathematics, Informatics, and Mechanics [Warsaw]","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039758270","display_name":"Sylvain Salvati","orcid":"https://orcid.org/0000-0002-6230-0098"},"institutions":[{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Sylvain Salvati","raw_affiliation_strings":["University of Bordeaux, CNRS, INRIA, Bordeaux, France","Laboratoire Bordelais de Recherche en Informatique"],"affiliations":[{"raw_affiliation_string":"University of Bordeaux, CNRS, INRIA, Bordeaux, France","institution_ids":["https://openalex.org/I15057530","https://openalex.org/I1326498283","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"Laboratoire Bordelais de Recherche en Informatique","institution_ids":["https://openalex.org/I4210142254"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064757019","display_name":"Igor Walukiewicz","orcid":null},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Igor Walukiewicz","raw_affiliation_strings":["University of Bordeaux, CNRS, INRIA, Bordeaux, France","Laboratoire Bordelais de Recherche en Informatique"],"affiliations":[{"raw_affiliation_string":"University of Bordeaux, CNRS, INRIA, Bordeaux, France","institution_ids":["https://openalex.org/I15057530","https://openalex.org/I1326498283","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"Laboratoire Bordelais de Recherche en Informatique","institution_ids":["https://openalex.org/I4210142254"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5074542253"],"corresponding_institution_ids":["https://openalex.org/I4654613"],"apc_list":null,"apc_paid":null,"fwci":2.156,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.8824582,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"96","last_page":"105"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9993000030517578,"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/T11567","display_name":"semigroups and automata theory","score":0.9984999895095825,"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/decidability","display_name":"Decidability","score":0.8764822483062744},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.8598588705062866},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.7749782800674438},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.7068287134170532},{"id":"https://openalex.org/keywords/diagonal","display_name":"Diagonal","score":0.6299944519996643},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.611785888671875},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.5958533883094788},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4694482982158661},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4678272604942322},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4580771327018738},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45717930793762207},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.44486480951309204},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.43322426080703735},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35959935188293457},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35374122858047485},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33430880308151245}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8764822483062744},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.8598588705062866},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.7749782800674438},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7068287134170532},{"id":"https://openalex.org/C130367717","wikidata":"https://www.wikidata.org/wiki/Q189791","display_name":"Diagonal","level":2,"score":0.6299944519996643},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.611785888671875},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.5958533883094788},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4694482982158661},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4678272604942322},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4580771327018738},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45717930793762207},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.44486480951309204},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.43322426080703735},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35959935188293457},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35374122858047485},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33430880308151245},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2933575.2934527","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2933575.2934527","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-01394830v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01394830","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"LICS, Jun 2016, New York, United States. pp.96 - 105, ⟨10.1145/2933575.2934527⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01394830v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01394830","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"LICS, Jun 2016, New York, United States. pp.96 - 105, ⟨10.1145/2933575.2934527⟩","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W49167929","https://openalex.org/W1503681652","https://openalex.org/W1593799327","https://openalex.org/W1646789098","https://openalex.org/W1955693250","https://openalex.org/W1989109065","https://openalex.org/W2007098021","https://openalex.org/W2015009579","https://openalex.org/W2076508310","https://openalex.org/W2093695603","https://openalex.org/W2100532597","https://openalex.org/W2102644483","https://openalex.org/W2113283923","https://openalex.org/W2138308600","https://openalex.org/W2138316064","https://openalex.org/W2150868717","https://openalex.org/W2154109182","https://openalex.org/W2160527279","https://openalex.org/W2175025672","https://openalex.org/W2249237842","https://openalex.org/W2267611784","https://openalex.org/W2275545295","https://openalex.org/W2277816930","https://openalex.org/W2346985033","https://openalex.org/W2442545619","https://openalex.org/W2950324689","https://openalex.org/W2964055444","https://openalex.org/W2964277871","https://openalex.org/W6601971489","https://openalex.org/W6693550832"],"related_works":["https://openalex.org/W2032269072","https://openalex.org/W1989788631","https://openalex.org/W1999231617","https://openalex.org/W2961758588","https://openalex.org/W2047831585","https://openalex.org/W4224983736","https://openalex.org/W4288581691","https://openalex.org/W2951140680","https://openalex.org/W2912654482","https://openalex.org/W2150468037"],"abstract_inverted_index":{"A":[0],"non-deterministic":[1],"recursion":[2],"scheme":[3],"recognizes":[4],"a":[5],"language":[6],"of":[7,26,49,51,68],"finite":[8],"trees.":[9],"This":[10,32],"very":[11],"expressive":[12],"model":[13],"can":[14],"simulate,":[15],"among":[16],"others,":[17],"higher-order":[18],"pushdown":[19],"automata":[20],"with":[21],"collapse.":[22],"We":[23],"show":[24],"decidability":[25],"the":[27,46],"diagonal":[28],"problem":[29],"for":[30],"schemes.":[31,55],"result":[33],"has":[34,59],"several":[35],"interesting":[36],"consequences.":[37],"In":[38,56],"particular,":[39],"it":[40],"gives":[41],"an":[42],"algorithm":[43],"that":[44],"computes":[45],"downward":[47],"closure":[48],"languages":[50],"words":[52],"recognized":[53],"by":[54],"turn,":[57],"this":[58],"immediate":[60],"application":[61],"to":[62],"separability":[63],"problems":[64],"and":[65],"reachability":[66],"analysis":[67],"concurrent":[69],"systems.":[70]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-07T14:57:38.498316","created_date":"2025-10-10T00:00:00"}