Enumerating outer narrowing derivationsfor constructor-based term rewriting systems
- 30 April 1989
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 7 (3-4) , 319-341
- https://doi.org/10.1016/s0747-7171(89)80015-x
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Basic narrowing revisitedJournal of Symbolic Computation, 1989
- Extended unification algorithms for the integration of functional programming into logic programmingThe Journal of Logic Programming, 1987
- A class of confluent term rewriting systems and unificationJournal of Automated Reasoning, 1986
- Equality, types, modules, and (why not?) generics for logic programmingThe Journal of Logic Programming, 1984
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and AssociativityJournal of the ACM, 1974
- Logical WritingsPublished by Springer Nature ,1971