Advertisement

Programming with \(\mathcal{TOY}(\mathcal{FD})\)

  • Antonio J. Fernández
  • Teresa Hortalá-González
  • Fernando Sáenz-Pérez
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3709)

Abstract

In [1] we presented the language \(\mathcal{TOY}(\mathcal{FD})\) that integrates the best features of existing functional and logic languages, as well as finite domain (\(\mathcal{FD}\)) constraint solving. We believe that \(\mathcal{TOY}(\mathcal{FD})\) is more flexible and expressive than the existing approaches of constraint logic programming on finite domain (CLP(\(\mathcal{FD}\))) as it integrates \(\mathcal{FD}\) constraint solving, lazy evaluation, higher order applications of functions and constraints, polymorphism, type checking, composition of functions (and, in particular, constraints), combination of relational and functional notation, and a number of other characteristics. These features allow to write more concise programs, therefore increasing the expressivity level.

References

  1. 1.
    Fernández, A.J., Hortalá-González, M.T., Sáenz-Pérez, F.: Solving combinatorial problems with a constraint functional logic language. In: Dahl, V., Wadler, P. (eds.) PADL 2003. LNCS, vol. 2562, pp. 320–338. Springer, Heidelberg (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Antonio J. Fernández
    • 1
  • Teresa Hortalá-González
    • 2
  • Fernando Sáenz-Pérez
    • 2
  1. 1.Dpto. Lenguajes y Ciencias de la ComputaciónUniv. of MálagaSpain
  2. 2.Dpto. Sist. Inf. y Prog. Univ. Complutense of MadridSpain

Personalised recommendations