Modularity in noncopying term rewriting
- 11 December 1995
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 152 (1) , 139-169
- https://doi.org/10.1016/0304-3975(94)00248-3
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Completeness of Combinations of Constructor SystemsJournal of Symbolic Computation, 1993
- Modularity of simple termination of term rewriting systems with shared constructorsTheoretical Computer Science, 1992
- On termination of the direct sum of term-rewriting systemsInformation Processing Letters, 1987
- Counterexamples to termination for the direct sum of term rewriting systemsInformation Processing Letters, 1987
- On the Church-Rosser property for the direct sum of term rewriting systemsJournal of the ACM, 1987
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Proving termination with multiset orderingsCommunications of the ACM, 1979