On completeness of narrowing strategies
From MaRDI portal
Publication:912605
DOI10.1016/0304-3975(90)90032-DzbMath0698.68027MaRDI QIDQ912605
Publication date: 1990
Published in: Theoretical Computer Science (Search for Journal in Brave)
68W30: Symbolic computation and algebraic computation
68Q65: Abstract data types; algebraic specification
08C05: Categories of algebras
Related Items
Cites Work
- Conditional rewrite rules
- Basic narrowing revisited
- The relation between logic and functional languages: a survey
- Contributions to the Theory of Logic Programming
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
- Equality, types, modules, and (why not?) generics for logic programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item