A Narrowing Procedure for Theories with Constructors
- 1 January 1984
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A higher-order implementation of rewritingScience of Computer Programming, 1983
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- Proofs by Induction in “Fairly” Specified Equational TheoriesPublished by Springer Nature ,1982
- A Unification Algorithm for Associative-Commutative FunctionsJournal of the ACM, 1981
- How to prove algebraic inductive hypotheses without inductionPublished by Springer Nature ,1980
- Mechanizing structural induction part II: StrategiesTheoretical Computer Science, 1979
- Resolution Strategies as Decision ProceduresJournal of the ACM, 1976
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and AssociativityJournal of the ACM, 1974
- Linear resolution with selection functionArtificial Intelligence, 1972
- Proving Properties of Programs by Structural InductionThe Computer Journal, 1969