A strong restriction of the inductive completion procedure
- 30 September 1989
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 8 (3) , 253-276
- https://doi.org/10.1016/s0747-7171(89)80069-0
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Inductive Completion by Ground Proof TransformationPublished by Elsevier ,1989
- Fair Conditional Term Rewriting Systems: Unification, Termination and ConfluencePublished by Springer Nature ,1985
- Conditional rewrite rulesTheoretical Computer Science, 1984
- Oriented equational clauses as a programming languageThe Journal of Logic Programming, 1984
- Deductive synthesis of the unification algorithmScience of Computer Programming, 1981
- A complete proof of correctness of the Knuth-Bendix completion algorithmJournal of Computer and System Sciences, 1981
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Mechanizing structural induction part II: StrategiesTheoretical Computer Science, 1979
- Mechanizing structural induction part I: Formal systemTheoretical Computer Science, 1979
- Proving Properties of Programs by Structural InductionThe Computer Journal, 1969