A rewriting strategy to verify observational congruence
- 1 August 1990
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 35 (4) , 191-199
- https://doi.org/10.1016/0020-0190(90)90023-q
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Completion for rewriting modulo a congruenceTheoretical Computer Science, 1989
- Completion of a Set of Rules Modulo a Set of EquationsSIAM Journal on Computing, 1986
- Termination orderings for associative-commutative rewriting systemsJournal of Symbolic Computation, 1985
- Algebraic laws for nondeterminism and concurrencyJournal of the ACM, 1985
- Complete Sets of Reductions for Some Equational TheoriesJournal of the ACM, 1981
- A Catalogue of Canonical Term Rewriting Systems.Published by Defense Technical Information Center (DTIC) ,1980