Termination Modulo Combinations of Equational Theories
- 1 January 2009
- book chapter
- Published by Springer Nature
- p. 246-262
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Equational rules for rewriting logicTheoretical Computer Science, 2002
- A total AC-compatible ordering based on RPOTheoretical Computer Science, 1995
- Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operationsTheoretical Computer Science, 1992
- Termination and completion modulo associativity, commutativity and identityTheoretical Computer Science, 1992
- Combining matching algorithms: The regular caseJournal of Symbolic Computation, 1991
- Completion for rewriting modulo a congruenceTheoretical Computer Science, 1989
- Termination of rewriting systems by polynomial interpretations and its implementationScience of Computer Programming, 1987
- Completion of a Set of Rules Modulo a Set of EquationsSIAM Journal on Computing, 1986
- Complete Sets of Reductions for Some Equational TheoriesJournal of the ACM, 1981
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980