University of Cambridge > Talks.cam > Computer Laboratory Programming Research Group Seminar > Monadic Constraint Programming

Monadic Constraint Programming

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Dominic Orchard.

A constraint programming system combines two essential components: a constraint solver and a search engine. The constraint solver reasons about satisfiability of conjunctions of constraints, and the search engine controls the search for solutions by iteratively exploring a disjunctive search tree defined by the constraint program. In this paper we give a monadic definition of constraint programming where the solver is defined as a monad threaded through the monadic search tree. We are then able to define search and search strategies as first class objects that can themselves be built or extended by composable search transformers. Search transformers give a powerful and unifying approach to viewing search in constraint programming, and the resulting constraint programming system is first class and extremely flexible.

This talk is based on joint work with Peter Stuckey and Philip Wadler, recently accepted for publication by the Journal of Functional Programming: http://www.cs.kuleuven.be/~toms/Research/papers/monadic_cp_draft.pdf

This talk is part of the Computer Laboratory Programming Research Group Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity