TERMINATION OF ABSTRACT REDUCTION SYSTEMS
From MaRDI portal
Recommendations
- A proof-theoretic study of abstract termination principles
- scientific article; zbMATH DE number 3930339
- Termination proof of term rewriting system with the multiset path ordering. A complete development in the system Coq
- A general theorem on termination of rewriting
- Termination of combined (rewrite and λ-calculus) systems
Cites work
- scientific article; zbMATH DE number 3557754 (Why is no real title available?)
- scientific article; zbMATH DE number 3216177 (Why is no real title available?)
- Modular termination proofs for rewriting using dependency pairs
- Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations
- Natural termination
- On the union of well-founded relations
- Proof-theoretic analysis of termination proofs
- Termination for direct sums of left-linear complete term rewriting systems
Cited in
(7)- Jumping and escaping: modular termination and the abstract path ordering
- An insertion operator preserving infinite reduction sequences
- Finding Lexicographic Orders for Termination Proofs in Isabelle/HOL
- Termination and reduction checking for higher-order logic programs
- scientific article; zbMATH DE number 975697 (Why is no real title available?)
- Termination by abstraction
- Abstract abstract reduction
This page was built for publication: TERMINATION OF ABSTRACT REDUCTION SYSTEMS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3620615)