
TL;DR
This paper introduces an improved first-order formative rules technique for term rewriting, simplifying termination proofs by reducing constraints, and adapting a higher-order concept to the first-order context.
Contribution
It adapts the formative rules method from higher-order to first-order term rewriting, enabling more efficient termination proofs.
Findings
Significant reduction in constraints during termination proofs
Enhanced technique for first-order term rewriting
Improved efficiency over previous methods
Abstract
This paper discusses the method of formative rules for first-order term rewriting, which was previously defined for a higher-order setting. Dual to the well-known usable rules, formative rules allow dropping some of the term constraints that need to be solved during a termination proof. Compared to the higher-order definition, the first-order setting allows for significant improvements of the technique.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Logic, Reasoning, and Knowledge · Formal Methods in Verification
