We compare the expressive power of three programming abstractions for user-defined
computational effects: Plotkin and Pretnar's effect handlers, Filinski's monadic reflection, and …

This paper introduces MiniCP, a lightweight, open-source solver for constraint programming.
MiniCP is motivated by educational purposes and the desire to provide the core …

We compare the expressive power of three programming abstractions for user-defined
computational effects: Plotkin and Pretnar's effect handlers, Filinski's monadic reflection, and …

Much of the power of CP comes from the ability to create complex hybrid search algorithms
specific to an application. Unfortunately there is no widely accepted standard for specifying …

Providing efficient black-box search procedures is one of the major concerns for constraint-
programming solvers. Most of the contributions in that area follow the fail-first principle …

This paper describes an abstract problem derived from a combination of Siemens product
configuration problems encountered in practice. Often isolated parts of configuration …

Objective-CP is an optimization system that views an optimization program as the
combination of a model, a search, and a solver. Models in Objective-CP follow the modeling …

Technology for combinatorial optimization is rapidly changing, and as the size and scope of
problems that can be solved steadily increases, the complexity of the underlying technology …

We make monadic components more reusable and robust to changes by employing two
new techniques for virtualizing the monad stack: the monad zipper and monad views. The …

Abstract Horn Clause Programs have a natural exhaustive depth-first procedural semantics.
However, for many programs this semantics is ineffective. In order to compute useful …