Higher-order narrowing with convergent systems

DOI10.1007/3-540-60043-4_54zbMath1496.68116OpenAlexW1578405723MaRDI QIDQ5096386

Christian Prehofer

Publication date: 16 August 2022

Published in: Algebraic Methodology and Software Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60043-4_54

Mathematics Subject Classification ID

Logic in computer science (03B70) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Higher-order narrowing with definitional trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lazy narrowing: strong completeness and eager variable elimination
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Higher-order rewrite systems and their confluence
• A proof theory for general unification
• Proving and applying program transformations expressed with second-order patterns
• Higher-order unification revisited: Complete sets of transformations
• Completion of a Set of Rules Modulo a Set of Equations
• A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
• The integration of functions into logic programming: From theory to practice
• Towards a domain theory for termination proofs
• Higher order conditional rewriting and narrowing
• Decidable higher-order unification problems