This paper describes a proposal to incorporate finite domain constraints in a functional logic system. The proposal integrates functions, higher-order patterns, partial applications, non-determinism, logical variables, currying, types, lazyness, domain variables, constraints and finite domain propagators. The paper also presents TOY(FD), an extension of the functional logic language TOY that provides FD constraints, and shows, by examples, that TOY(FD) combines the power of constraint logic programming with the higher-order characteristics of functional logic programming. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Fernández, A. J., Hortalá-González, T., & Sáenz-Pérez, F. (2003). Solving combinatorial problems with a constraint functional logic language. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2562, 320–338. https://doi.org/10.1007/3-540-36388-2_22
Mendeley helps you to discover research relevant for your work.