Combination techniques for non-disjoint equational theories
- 1 January 1994
- book chapter
- Published by Springer Nature
- p. 267-281
- https://doi.org/10.1007/3-540-58156-1_19
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Modularity of simple termination of term rewriting systems with shared constructorsTheoretical Computer Science, 1992
- Unification in the union of disjoint equational theories: Combining decision proceduresPublished by Springer Nature ,1992
- Complete sets of transformations for general E-unificationTheoretical Computer Science, 1989
- Unification in a combination of arbitrary disjoint equational theoriesJournal of Symbolic Computation, 1989
- Unification in combinations of collapse-free regular theoriesJournal of Symbolic Computation, 1987
- Recursive Unsolvability of a problem of ThueThe Journal of Symbolic Logic, 1947