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

DOI10.1007/978-3-540-75292-9_12zbMath1147.68430OpenAlexW1522171014MaRDI QIDQ3525083

Rafael 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

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

Related Items (4)

A new generic scheme for functional logic programming with constraints ⋮ A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains ⋮ Cooperation of Algebraic Constraint Domains in Higher-Order Functional and Logic Programming ⋮ A Framework for Interpreting Traces of Functional Logic Computations

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