Automatic proofs by induction in theories without constructors
- 1 July 1989
- journal article
- Published by Elsevier in Information and Computation
- Vol. 82 (1) , 1-33
- https://doi.org/10.1016/0890-5401(89)90062-x
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Simplifying conditional term rewriting systems : Unification, termination and confluenceJournal of Symbolic Computation, 1987
- Reveur-3: the implementation of a general completion procedure parameterized by built-in theories and strategiesScience of Computer Programming, 1987
- Semantic confluence tests and completion methodsInformation and Control, 1985
- Computing with rewrite systemsInformation and Control, 1985
- Process algebra for synchronous communicationInformation and Control, 1984
- A complete proof of correctness of the Knuth-Bendix completion algorithmJournal of Computer and System Sciences, 1981