Equational completion in order-sorted algebras
Authors:
Open Access
- 23 May 1990
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 72 (2-3) , 169-202
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Termination of rewritingJournal of Symbolic Computation, 1987
- Completion of a Set of Rules Modulo a Set of EquationsSIAM Journal on Computing, 1986
- Proofs by induction in equational theories with constructorsJournal of Computer and System Sciences, 1982
- On multiset orderingsInformation Processing Letters, 1982
- Programming with EquationsACM Transactions on Programming Languages and Systems, 1982
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- A complete proof of correctness of the Knuth-Bendix completion algorithmJournal of Computer and System Sciences, 1981
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- HOPE1980
- Proving termination with multiset orderingsCommunications of the ACM, 1979