Completeness of combinations of constructor systems
- 1 January 1991
- book chapter
- Published by Springer Nature
- p. 188-199
- https://doi.org/10.1007/3-540-53904-2_96
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A sufficient condition for the termination of the direct sum of term rewriting systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Rewrite SystemsPublished by Elsevier ,1990
- Termination for the direct sum of left-linear term rewriting systemsPublished by Springer Nature ,1989
- Modular aspects of properties of term rewriting systems related to normal formsPublished by Springer Nature ,1989
- 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
- Termination of linear rewriting systemsPublished by Springer Nature ,1981
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- On Theories with a Combinatorial Definition of "Equivalence"Annals of Mathematics, 1942