Environment v4.30.0. The archive's epoch is v4.33.0; only submissions in v4.30.0 can cite this work.
Proof of `Word-RAM evaluation of tree automata` (2nd statement)
groundedproofs/Lax53Proofs/AutomatonLinearTime.lean · lax-53
What this proof establishes
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
The fixed compiled program first reads and materializes the distinguished structural arena and then runs the verified bottom-up evaluator. Lax58's reusable predicate packages the program and the three sufficient-width premises; the underlying expanded theorem above remains inspectable.