How to prove equivalence of term rewriting systems without induction
- 1 January 1986
- book chapter
- Published by Springer Nature
- p. 118-127
- https://doi.org/10.1007/3-540-16780-3_84
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A decidability result about sufficient-completeness of axiomatically specified abstract data typesPublished by Springer Nature ,2006
- Completeness in data type specificationsPublished by Springer Nature ,1985
- On solving the equality problem in theories defined by Horn clausesPublished by Springer Nature ,1985
- On graph rewritingsTheoretical Computer Science, 1984
- Proofs by induction in equational theories with constructorsJournal of Computer and System Sciences, 1982
- Confluent and Other Types of Thue SystemsJournal of the ACM, 1982
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- On proving inductive properties of abstract data typesPublished by Association for Computing Machinery (ACM) ,1980
- Equations and Rewrite Rules: A SurveyPublished by Elsevier ,1980
- A Transformation System for Developing Recursive ProgramsJournal of the ACM, 1977