A Higher-Order Demand-Driven Narrowing Calculus with Definitional Trees

DOI10.1007/978-3-540-75292-9_12MaRDI QIDQ3525083zbMATH OpenOpenAlexFDO

Authors R. del Vado Vírseda

Publication date 17 September 2008

Published in Theoretical Aspects of Computing – ICTAC 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-75292-9_12

Mathematics Subject Classification ID

Logic programming (68N17) Functional programming and lambda calculus (68N18)

Recommendations

• Higher-order narrowing with definitional trees
• Higher-order narrowing with definitional trees
• scientific article; zbMATH DE number 1822269
• scientific article; zbMATH DE number 1696603
• Higher-order narrowing with convergent systems

Cited in

(10)

• A framework for interpreting traces of functional logic computations
• Cooperation of algebraic constraint domains in higher-order functional and logic programming
• Higher-order narrowing with definitional trees
• scientific article; zbMATH DE number 512892 (Why is no real title available?)
• scientific article; zbMATH DE number 1822269 (Why is no real title available?)
• Higher-order narrowing with definitional trees
• A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains
• Functional and Logic Programming
• Frontiers of Combining Systems
• A new generic scheme for functional logic programming with constraints

This page was built for publication: A Higher-Order Demand-Driven Narrowing Calculus with Definitional Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525083)