Higher-order narrowing with definitional trees
From MaRDI portal
Publication:5055857
DOI10.1007/3-540-61464-8_48zbMATH Open1503.68033OpenAlexW1550461844MaRDI QIDQ5055857FDOQ5055857
Authors: Michael Hanus, Christian Prehofer
Publication date: 9 December 2022
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61464-8_48
Recommendations
Logic programming (68N17) Grammars and rewriting systems (68Q42) Functional programming and lambda calculus (68N18)
Cites Work
- Logic programming with functions and predicates: The language Babel
- Title not available (Why is that?)
- The lambda calculus. Its syntax and semantics. Rev. ed.
- A needed narrowing strategy
- Title not available (Why is that?)
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
- Higher-order families
- Kernel-LEAF: A logic plus functional language
- The integration of functions into logic programming: From theory to practice
- A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
- Higher order conditional rewriting and narrowing
- Interaction Systems I: The theory of optimal reductions
- Decidable higher-order unification problems
- Higher-order narrowing with definitional trees
- Higher-order narrowing with convergent systems
Cited In (6)
Uses Software
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)