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

Authors:
Rafael del Vado Vírseda
Affiliations:
Dpto. de Sistemas Informáticos y Computación, Universidad Complutense de Madrid, Madrid, Spain
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2011

Citing 9
Cited 1

Solving Higher-Order Equations: From Logic to Programming

Solving Higher-Order Equations: From Logic to Programming
TOY: A Multiparadigm Declarative System

RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Higher-Order Lazy Narrowing Calculus: A Computation Model for a Higher-Order Functional Logic Language

ALP '97-HOA '97 Proceedings of the 6th International Joint Conference on Algebraic and Logic Programming
Higher-order narrowing with definitional trees

Journal of Functional Programming
A new generic scheme for functional logic programming with constraints

Higher-Order and Symbolic Computation
A higher-order logical framework for the algorithmic debugging and verification of declarative programs

PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
On the cooperation of the constraint domains ℋ, ℛ, and ℱ in cflp

Theory and Practice of Logic Programming
A higher-order demand-driven narrowing calculus with definitional trees

ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Isabelle/HOL: a proof assistant for higher-order logic

Isabelle/HOL: a proof assistant for higher-order logic

A modular semantics for higher-order declarative programming with constraints

Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a theoretical framework for the integration of the cooperative constraint solving of numeric constraint domains into higher-order functional and logic programming on @l-abstractions, using an instance of a generic Constraint Functional Logic Programming (CFLP) scheme over a so-called higher-order coordination domain. We provide this framework as a powerful computational model for the higher-order cooperation of algebraic constraint domains over real numbers and integers, which has been useful in practical applications involving the hybrid combination of its components, so that more declarative and efficient solutions can be promoted. Our proposal of computational model has been proved sound and complete with respect to the declarative semantics provided by the CFLP scheme, and enriched with new mechanisms for modeling the intended cooperation among the numeric domains and a novel higher-order constraint domain equipped with a sound and complete constraint solver for solving higher-order equations. We argue the applicability of our approach describing a prototype implementation on top of the constraint functional logic system TOY.