Unrolling heuristic for recursive functions is complete for first-order theories of algebraic datatypes combined with decidable quantifier-free background theories.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Complete first-order reasoning for functional programs
Unrolling heuristic for recursive functions is complete for first-order theories of algebraic datatypes combined with decidable quantifier-free background theories.