Monadic Constraint Programming

The aim of this project is to model the generic aspects of Constraint Programming in Haskell. Of particular interest is the solver-independent framework for composable search strategies. This project involves Peter Stuckey and Phil Wadler.

In the second phase of the project, Pieter Wuille and I are developing a layer in the framework for Finite Domain constraint solvers. Of particular interest here is the Gecode C++ backend.

  • Monadic Constraint Programming with Gecode, Ph.D. project of Pieter Wuille
    • Expressive Models for Monadic Constraint Programming, P. Wuille, T. Schrijvers. Presented at ModRef 2010. [draft]
    • Finite Domain modeling and solving in the Monadic Constraint Programming framework, P. Wuille, T. Schrijvers. Abstract at ORBEL24.
    • Parameterized Models for On-line and Off-line Use, P. Wuille, T. Schrijvers. Presented at WFLP 2010. [paper, post-proceedings]
    • Monadic Constraint Programming with Gecode, P. Wuille, T. Schrijvers. Presented at ModRef 2009. [paper pdf] [slides pdf] [Details]
  • Monadic Constraint Programming, T. Schrijvers, P. Stuckey, P. Wadler. Published in the Journal of Functional Programming. [draft pdf]
    • Monadic Constraint Programming, T. Schrijvers, presented at WLP 2009, AngloHaskell 2009, Oxford University, Cambridge University and University of Kent. [slides]
    • First Class Constraint Programming in Haskell, T. Schrijvers, P. Stuckey, P. Wadler. Work in progress presented at SingHaskell, November 28, 2007. [slides] [Details]