Unrolling heuristic for recursive functions is complete for first-order theories of algebraic datatypes combined with decidable quantifier-free background theories.
Formal adventures in convex and conical spaces
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2years
2026 2representative 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.
- A cubical formalisation of conditional independence, Bayesian conditioning, and Pearl's d-separation soundness