Conditional rewrite rules: Confluence and termination
Authors:
- 1 June 1986
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 32 (3) , 323-362
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Towards executable specifications using conditional axiomsLecture Notes in Computer Science, 1984
- Conditional rewrite rulesTheoretical Computer Science, 1984
- The Lambda Calculus - Its Syntax and Semantics1984
- Unique normal forms in term rewriting systems with repeated variables1981
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Equations and Rewrite Rules: A Survey1980
- Parameterized data types in algebraic specification languages1980
- A characterisation of computable data types by means of a finite equational specification method1980
- Minimal and Optimal Computations of Recursive ProgramsJournal of the ACM, 1979
- Computing in systems described by equationsLecture Notes in Computer Science, 1977