Uniform narrowing strategies
- 1 January 1992
- book chapter
- Published by Springer Nature
- p. 259-275
- https://doi.org/10.1007/bfb0013831
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Sufficient-completeness, ground-reducibility and their complexityActa Informatica, 1991
- On completeness of narrowing strategiesTheoretical Computer Science, 1990
- Rewrite SystemsPublished by Elsevier ,1990
- Extending SLD resolution to equational horn clauses using E-unificationThe Journal of Logic Programming, 1989
- Extended unification algorithms for the integration of functional programming into logic programmingThe Journal of Logic Programming, 1987
- On sufficient-completeness and related properties of term rewriting systemsActa Informatica, 1987
- Design and implementation of a generic, logic and functional programming languagePublished by Springer Nature ,1986
- Complete sets of unifiers and matchers in equational theoriesTheoretical Computer Science, 1986
- Semantic confluence tests and completion methodsInformation and Control, 1985
- Canonical forms and unificationPublished by Springer Nature ,1980