Completeness results for basic narrowing
- 1 May 1994
- journal article
- research article
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 5 (3-4) , 213-253
- https://doi.org/10.1007/bf01190830
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Kernel-LEAF: A logic plus functional languageJournal of Computer and System Sciences, 1991
- Narrowing directed by a graph of termsPublished by Springer Nature ,1991
- A rationale for conditional equational programmingTheoretical Computer Science, 1990
- On completeness of narrowing strategiesTheoretical Computer Science, 1990
- Foundations of Equational Logic ProgrammingPublished by Springer Nature ,1989
- Narrowing vs. SLD-resolutionTheoretical Computer Science, 1988
- Confluence of conditional rewrite systemsPublished by Springer Nature ,1988
- Conditional rewrite rules: Confluence and terminationJournal of Computer and System Sciences, 1986
- Conditional rewrite rulesTheoretical Computer Science, 1984
- Proving termination with multiset orderingsCommunications of the ACM, 1979