Decreasing Diagrams and Relative Termination
- 13 September 2011
- journal article
- research article
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 47 (4) , 481-501
Abstract
No abstract availableKeywords
All Related Versions
This publication has 19 references indexed in Scilit:
- KBO OrientabilityJournal of Automated Reasoning, 2009
- Proving Confluence of Term Rewriting Systems Automatically2009
- Matrix Interpretations for Proving Termination of Term RewritingJournal of Automated Reasoning, 2007
- Generalizing Newman’s Lemma for Left-Linear Rewrite SystemsLecture Notes in Computer Science, 2006
- Solving Partial Order Constraints for LPO Termination2006
- Higher-order rewrite systems and their confluenceTheoretical Computer Science, 1998
- Developing developmentsTheoretical Computer Science, 1997
- Confluence by decreasing diagramsTheoretical Computer Science, 1994
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Tree-Manipulating Systems and Church-Rosser TheoremsJournal of the ACM, 1973