Equivalence of higher-order string-to-string polyregular functions is undecidable by reduction from the tiling problem.
Rabin and Dana Scott
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Polyregular equivalence is undecidable in higher-order types
Equivalence of higher-order string-to-string polyregular functions is undecidable by reduction from the tiling problem.