Positive finite denotation implies head convergence
ProvedTreeEquivalenceHORS.Equivalence.positive_finite_denotation_convergescomputabilityrecursion-schemes
In every valid scheme, a positive finite-model value for a closed ground term yields a finite head evaluation to a terminal.
Preamble
import Definitions.Def_TreeEquivalenceHORS_Equivalence_FiniteSemantics
Formal statement
namespace TreeEquivalenceHORS.Equivalence
theorem positive_finite_denotation_converges (G : HORS) (vg : G.Valid) (t : Tm) (ht : G.typeOf [] t = some .o)
(h : G.den [] G.etaStar [] t = .bit true) : ∃ c us, G.HeadConv t c us := by sorry
end TreeEquivalenceHORS.EquivalenceSource
Mingkun Xiao and Yixuan Sun, Tree Equivalence of Higher-Order Recursion Schemes Is Undecidable, §§3 and 5.6. https://arxiv.org/html/2610.39678v1