On Proving Uniform Termination and Restricted Termination of Rewriting Systems
- 1 February 1983
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 12 (1) , 189-214
- https://doi.org/10.1137/0212012
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Complete Sets of Reductions for Some Equational TheoriesJournal of the ACM, 1981
- Termination of linear rewriting systemsPublished by Springer Nature ,1981
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Equations and Rewrite Rules: A SurveyPublished by Elsevier ,1980
- Abstract Data Type Specification in the Affirm SystemIEEE Transactions on Software Engineering, 1980
- Abstract data types and software validationCommunications of the ACM, 1978
- Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research.Published by Elsevier ,1970