Commutation, transformation, and termination
- 1 January 1986
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Termination orderings for associative-commutative rewriting systemsJournal of Symbolic Computation, 1985
- Computing with rewrite systemsInformation and Control, 1985
- Refutational theorem proving using term-rewriting systemsArtificial Intelligence, 1985
- On Proving Uniform Termination and Restricted Termination of Rewriting SystemsSIAM Journal on Computing, 1983
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- Proofs by induction in equational theories with constructorsJournal of Computer and System Sciences, 1982
- Termination of linear rewriting systemsPublished by Springer Nature ,1981
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Operational and Semantic Equivalence Between Recursive ProgramsJournal of the ACM, 1980
- On proving inductive properties of abstract data typesPublished by Association for Computing Machinery (ACM) ,1980