Polyregular equivalence is undecidable in higher-order types
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866911589132664832 |
|---|---|
| author | Bojańczyk, Mikołaj Fabiański, Grzegorz Stefański, Rafał |
| author_facet | Bojańczyk, Mikołaj Fabiański, Grzegorz Stefański, Rafał |
| contents | It is open whether equivalence ( f = g ) is decidable for string-to-string polyregular functions. We consider their higher-order extension based on the λ-calculus definition of polyregular functions from Bojańczyk (2018). In this setting, equivalence is undecidable by reduction from the tiling problem. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_11935 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Polyregular equivalence is undecidable in higher-order types Bojańczyk, Mikołaj Fabiański, Grzegorz Stefański, Rafał Programming Languages Formal Languages and Automata Theory It is open whether equivalence ( f = g ) is decidable for string-to-string polyregular functions. We consider their higher-order extension based on the λ-calculus definition of polyregular functions from Bojańczyk (2018). In this setting, equivalence is undecidable by reduction from the tiling problem. |
| title | Polyregular equivalence is undecidable in higher-order types |
| topic | Programming Languages Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2604.11935 |