Higher-order narrowing with definitional trees
From MaRDI portal
Publication:5055857
Recommendations
Cites work
- scientific article; zbMATH DE number 3730111 (Why is no real title available?)
- scientific article; zbMATH DE number 3993540 (Why is no real title available?)
- A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
- A needed narrowing strategy
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
- Decidable higher-order unification problems
- Higher order conditional rewriting and narrowing
- Higher-order families
- Higher-order narrowing with convergent systems
- Higher-order narrowing with definitional trees
- Interaction Systems I: The theory of optimal reductions
- Kernel-LEAF: A logic plus functional language
- Logic programming with functions and predicates: The language Babel
- The integration of functions into logic programming: From theory to practice
- The lambda calculus. Its syntax and semantics. Rev. ed.
Cited in
(6)- A Higher-Order Demand-Driven Narrowing Calculus with Definitional Trees
- Higher-order families
- scientific article; zbMATH DE number 515736 (Why is no real title available?)
- scientific article; zbMATH DE number 1696604 (Why is no real title available?)
- Higher-order narrowing with definitional trees
- Functional and Logic Programming
This page was built for publication: Higher-order narrowing with definitional trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055857)