A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains

DOI10.1016/j.entcs.2011.03.005zbMath1347.68059OpenAlexW1967419422WikidataQ113318277 ScholiaQ113318277MaRDI QIDQ5179011

Rafael del Vado Vírseda

Publication date: 18 March 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2011.03.005

zbMATH Keywords

logic programmingfunctional programmingconstraint domainshigher-order cooperation

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Uses Software

• Isabelle
• Isabelle/HOL
• TOY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new generic scheme for functional logic programming with constraints
• Isabelle. A generic theorem prover
• Isabelle/HOL. A proof assistant for higher-order logic
• On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP
• A Higher-Order Demand-Driven Narrowing Calculus with Definitional Trees
• A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
• Higher-order narrowing with definitional trees
• The integration of functions into logic programming: From theory to practice

This page was built for publication: A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains