A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains
From MaRDI portal
Publication:5179011
DOI10.1016/j.entcs.2011.03.005zbMath1347.68059WikidataQ113318277 ScholiaQ113318277MaRDI QIDQ5179011
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
68N18: Functional programming and lambda calculus
03B70: Logic in computer science
68Q55: Semantics in the theory of computing
68N17: Logic programming
Uses Software
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item