{"id":"https://openalex.org/W4390604708","doi":"https://doi.org/10.1145/3632887","title":"Polyregular Functions on Unordered Trees of Bounded Height","display_name":"Polyregular Functions on Unordered Trees of Bounded Height","publication_year":2024,"publication_date":"2024-01-02","ids":{"openalex":"https://openalex.org/W4390604708","doi":"https://doi.org/10.1145/3632887"},"language":"en","primary_location":{"id":"doi:10.1145/3632887","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3632887","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3632887","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3632887","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050056333","display_name":"Miko\u0142aj Boja\u0144czyk","orcid":"https://orcid.org/0000-0002-7758-1072"},"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":"Miko\u0142aj Boja\u0144czyk","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":"last","author":{"id":"https://openalex.org/A5025346659","display_name":"Bartek Klin","orcid":"https://orcid.org/0000-0001-5793-7425"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Bartek Klin","raw_affiliation_strings":["University of Oxford, Oxford, UK"],"affiliations":[{"raw_affiliation_string":"University of Oxford, Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050056333"],"corresponding_institution_ids":["https://openalex.org/I4654613"],"apc_list":null,"apc_paid":null,"fwci":0.6884,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.71990314,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"8","issue":"POPL","first_page":"1326","last_page":"1351"},"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.9987999796867371,"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.9987999796867371,"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.9958999752998352,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9941999912261963,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.7221477031707764},{"id":"https://openalex.org/keywords/injective-function","display_name":"Injective function","score":0.7110702991485596},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6826976537704468},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6788342595100403},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5457155704498291},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5036935210227966},{"id":"https://openalex.org/keywords/monad","display_name":"Monad (category theory)","score":0.4405820965766907},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.41986769437789917},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32819145917892456},{"id":"https://openalex.org/keywords/functor","display_name":"Functor","score":0.24887561798095703}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7221477031707764},{"id":"https://openalex.org/C128107574","wikidata":"https://www.wikidata.org/wiki/Q182003","display_name":"Injective function","level":2,"score":0.7110702991485596},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6826976537704468},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6788342595100403},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5457155704498291},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5036935210227966},{"id":"https://openalex.org/C33959348","wikidata":"https://www.wikidata.org/wiki/Q1630568","display_name":"Monad (category theory)","level":3,"score":0.4405820965766907},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.41986769437789917},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32819145917892456},{"id":"https://openalex.org/C156772000","wikidata":"https://www.wikidata.org/wiki/Q864475","display_name":"Functor","level":2,"score":0.24887561798095703},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3632887","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3632887","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3632887","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:abb3e67c-52ca-4c65-bcea-736dd6104918","is_oa":true,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:abb3e67c-52ca-4c65-bcea-736dd6104918","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symplectic Elements","raw_type":"Conference item"}],"best_oa_location":{"id":"doi:10.1145/3632887","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3632887","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3632887","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7396241906","display_name":null,"funder_award_id":"2022/46/A/ST6/00072","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"}],"funders":[{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4390604708.pdf","grobid_xml":"https://content.openalex.org/works/W4390604708.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W1026721552","https://openalex.org/W1619058287","https://openalex.org/W1981870753","https://openalex.org/W2029001691","https://openalex.org/W2126513401","https://openalex.org/W2130872776","https://openalex.org/W2520797183","https://openalex.org/W2797808503","https://openalex.org/W2942769268","https://openalex.org/W3100044845","https://openalex.org/W3192359381","https://openalex.org/W4210631930","https://openalex.org/W4299855426","https://openalex.org/W4388553868"],"related_works":["https://openalex.org/W4226430568","https://openalex.org/W1865715204","https://openalex.org/W1482362836","https://openalex.org/W2096284940","https://openalex.org/W2916830211","https://openalex.org/W2964662755","https://openalex.org/W1994637428","https://openalex.org/W2021535402","https://openalex.org/W1569124960","https://openalex.org/W4232397231"],"abstract_inverted_index":{"We":[0,42,72],"consider":[1],"injective":[2,85],"first-order":[3,22,86,141,158],"interpretations":[4,87,142],"that":[5,44,134,147],"input":[6,34,64],"and":[7,80,109,160,167],"output":[8,18,40,68],"trees":[9,69,90],"of":[10,33,77,91,112,145],"bounded":[11,92,149],"height.":[12,93],"The":[13,94],"corresponding":[14],"functions":[15,50,79],"have":[16,148,162],"polynomial":[17],"size,":[19],"since":[20],"a":[21,26,38,75,99,110],"interpretation":[23],"can":[24,59],"use":[25],"<mml:math":[27],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[28],"display=\"inline\">":[29],"<mml:mi>k</mml:mi>":[30],"</mml:math>":[31],"-tuple":[32],"nodes":[35],"to":[36,115,173],"represent":[37],"single":[39],"node.":[41],"prove":[43],"the":[45,66,103,121,135,163],"equivalence":[46,122,136],"problem":[47,123,137],"for":[48,62,88,126,140],"such":[49,56],"is":[51,96,124,138],"decidable,":[52],"i.e.":[53],"given":[54],"two":[55,67],"interpretations,":[57,120],"one":[58],"decide":[60],"whether,":[61],"every":[63],"tree,":[65],"are":[70,106],"isomorphic.":[71],"also":[73,172],"give":[74],"calculus":[76,95],"typed":[78],"combinators":[81],"which":[82],"derives":[83],"exactly":[84],"unordered":[89],"based":[97],"on":[98],"type":[100,104],"system,":[101],"where":[102],"constructors":[105],"products,":[107],"coproducts":[108],"monad":[111],"multisets.":[113],"Thanks":[114],"our":[116],"results":[117,170],"about":[118],"tree-to-tree":[119],"decidable":[125,139],"this":[127,156],"calculus.":[128],"As":[129],"an":[130],"application,":[131],"we":[132],"show":[133],"between":[143],"classes":[144],"graphs":[146],"tree-depth.":[150],"In":[151],"all":[152,169],"cases":[153],"studied":[154],"in":[155],"paper,":[157],"logic":[159],"mso":[161,174],"same":[164],"expressive":[165],"power,":[166],"hence":[168],"apply":[171],"interpretations.":[175]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}