TERMINATION OF ABSTRACT REDUCTION SYSTEMS
From MaRDI portal
Publication:3620615
DOI10.1142/S0129054109006450zbMath1170.68502MaRDI QIDQ3620615
Publication date: 14 April 2009
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Natural termination
- Modular termination proofs for rewriting using dependency pairs
- Proof-theoretic analysis of termination proofs
- Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations
- Termination for direct sums of left-linear complete term rewriting systems
- On the union of well-founded relations