Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- 1 October 1980
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 27 (4), 797-821
- https://doi.org/10.1145/322217.322230
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Proving termination with multiset orderingsCommunications of the ACM, 1979
- Testing for the Church-Rosser PropertyJournal of the ACM, 1974
- Tree-Manipulating Systems and Church-Rosser TheoremsJournal of the ACM, 1973
- 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
- An Abstract form of the church-rosser theorem. IThe Journal of Symbolic Logic, 1969
- Proving Properties of Programs by Structural InductionThe Computer Journal, 1969
- Semi-Automated MathematicsJournal of the ACM, 1969
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965
- On Theories with a Combinatorial Definition of "Equivalence"Annals of Mathematics, 1942
- Some properties of conversionTransactions of the American Mathematical Society, 1936