Decidable approximations of term rewriting systems
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 362-376
- https://doi.org/10.1007/3-540-61464-8_65
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The theory of ground rewrite systems is decidablePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting SystemsSIAM Journal on Computing, 1993
- Sequentiality in orthogonal term rewriting systemsJournal of Symbolic Computation, 1991
- Rewrite SystemsPublished by Elsevier ,1990
- Simulation of Turing machines by a left-linear rewrite rulePublished by Springer Nature ,1989
- Reductions in tree replacement systemsTheoretical Computer Science, 1985
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Recursive Unsolvability of a problem of ThueThe Journal of Symbolic Logic, 1947