Solving Combinatorial Problems with a Constraint Functional Logic Language

  • Authors:
  • Antonio J. Fernández;Teresa Hortalá-González;Fernando Sáenz-Pérez

  • Affiliations:
  • -;-;-

  • Venue:
  • PADL '03 Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 TOYthat provides FD constraints, and shows, by examples, that TOY(FD) combines the power ofconstraint logic programming with the higher-order characteristics of functional logic programming.