Abstract
In [2] we proposed the integration of finite domain (FD) constraints into the functional logic programming language TOY, and, as result, presented the language TOY(FD). We showed that TOY(FD), integrates the best features of existing functional and logic languages into FD constraint solving. This paper describes a sketch (due to space limitations) of the TOY(FD), operational semantics that consists of a novel combination of lazy evaluation and FD constraint solving.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have