Next: Domains/Exclusions as Function Up: Finite Domains and Exclusions Previous: Clauses and bnd-to-is

Finite-Domain/Exclusion Functional Programming

Having introduced finite domains and exclusions into relational programming as terms that can be values of logical variables, we now transfer them to functional programming as terms that can be arguments and values of functions. (Similarly, the binding construct can be employed in function arguments and values.)

Domains and exclusions thus become first-class citizens of relational-functional languages such as RELFUN.



Harold Boley & Michael Sintek (sintek@dfki.uni-kl.de)