Equational completion in order-sorted algebras extended abstract
- 10 June 2005
- book chapter
- Published by Springer Nature
- p. 165-184
- https://doi.org/10.1007/bfb0026103
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Operational semantics for order-sorted algebraPublished by Springer Nature ,2005
- Abstract data types with exception handling: An initial approach based on a distinction between exceptions and errorsTheoretical Computer Science, 1986
- Completion of a Set of Rules Modulo a Set of EquationsSIAM Journal on Computing, 1986
- Principles of OBJ2Published by Association for Computing Machinery (ACM) ,1985
- TerminationPublished by Springer Nature ,1985
- Completion of a set of rules modulo a set of equationsPublished by Association for Computing Machinery (ACM) ,1984
- 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
- Equations and Rewrite Rules: A SurveyPublished by Elsevier ,1980