Extending the TOY system with the ECL^iPS^e solver over sets of integers

DOI10.1007/978-3-642-29822-6_12MaRDI QIDQ2900259zbMATH OpenOpenAlexFDO

Authors S. Estévez Martín, Jesús Correas Fernández, F. Sáenz-Pérez

Publication date 20 July 2012

Published in Functional and Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29822-6_12

zbMATH Keywords

constrained lazy narrowingconstraint functional logic programmingdomain cooperationimplementation

Mathematics Subject Classification ID

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

Recommendations

• On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP
• A fully sound goal solving calculus for the cooperation of solvers in the CFLP scheme
• Cooperation of algebraic constraint domains in higher-order functional and logic programming
• A proposal for the cooperation of solvers in constraint functional logic programming
• A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains

Describes a project that uses

Uses Software

• TOY

This page was built for publication: Extending the \(\mathcal{TOY}\) system with the \(\mathrm{ECL}^i\mathrm{PS}^e\) solver over sets of integers

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