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

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.