Finite domain constraints in the ML functional language

Abstract

We propose an extension of the ML language for handling constraints in finite domains, as originally proposed by the CHIP Constraint Logic Programming Language, following and attending techniques originating from Constraint Satisfaction Problems. This makes it possible for the programmer to declaratively combine in a single application both purely functional parts and constraint solving parts for efficient handling of discrete search problems. In order to show the effectiveness of this approach, we present a simple demonstrative problem-solving example using finite domain constraints such as linear equations and disequations.<>