Constraint functional logic programming over finite domains

  • Authors:
  • Antonio J. Fernandez;Teresa Hortala-Gonzalez;Fernando Saenz-Perez;Rafael Del Vado-Virseda

  • Affiliations:
  • Dpto. de Lenguajes y Ciencias de la Computación, Universidad de Málaga, Spain E-mail: afdez@lcc.uma.es;Dpto. de Sistemas Informáticos y Programación Universidad Complutense de Madrid, Spain E-mails: teresa@sip.ucm.es, fernan@sip.ucm.es, rdelvado@sip.ucm.es;Dpto. de Sistemas Informáticos y Programación Universidad Complutense de Madrid, Spain E-mails: teresa@sip.ucm.es, fernan@sip.ucm.es, rdelvado@sip.ucm.es;Dpto. de Sistemas Informáticos y Programación Universidad Complutense de Madrid, Spain E-mails: teresa@sip.ucm.es, fernan@sip.ucm.es, rdelvado@sip.ucm.es

  • Venue:
  • Theory and Practice of Logic Programming
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we present our proposal to Constraint FunctionalLogic Programming over Finite Domains(CFLP(ℱ𝐷) with a lazy functional logicprogramming language which seamlessly embodies finite domain(ℱ𝐷) constraints. This proposal increases theexpressiveness and power of constraint logic programming overfinite domains (CLP(ℱ𝐷) by combiningfunctional and relational notation, curried expressions,higher-order functions, patterns, partial applications,non-determinism, lazy evaluation, logical variables, types, domainvariables, constraint composition, and finite domain constraints.We describe the syntax of the language, its type discipline, andits declarative and operational semantics. We also describe𝑇𝑂𝑌 (ℱ𝐷), an implementationfor CFLP(ℱ𝐷), and a comparison of ourapproach with respect to CLP(ℱ𝐷) from aprogramming point of view, showing the new features we introduce.And, finally, we show a performance analysis which demonstratesthat our implementation is competitive with respect to existingCLP(ℱ𝐷) systems and that clearlyoutperforms the closer approach toCFLP(ℱ𝐷).