BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Monadic Constraint Programming - Tom Schrijvers (Leuven)
DTSTART:20090619T141500Z
DTEND:20090619T151500Z
UID:TALK18851@talks.cam.ac.uk
CONTACT:Dominic Orchard
DESCRIPTION:A constraint programming system combines two essential compone
 nts: a constraint solver and a search engine. The constraint solver reason
 s about satisfiability of conjunctions of constraints\, and the search eng
 ine controls the search for solutions by iteratively exploring a disjuncti
 ve search tree defined by the constraint program. In this paper we give a 
 monadic definition of constraint programming where the solver is defined a
 s a monad threaded through the monadic search tree. We are then able to de
 fine search and search strategies as first class objects that can themselv
 es be built or extended by composable search transformers. Search transfor
 mers give a powerful and unifying approach to viewing search in constraint
  programming\, and the resulting constraint programming system is first cl
 ass and extremely flexible.\n\nThis talk is based on joint work with Peter
  Stuckey and Philip Wadler\, recently accepted for publication by the Jour
 nal of Functional Programming:\nhttp://www.cs.kuleuven.be/~toms/Research/p
 apers/monadic_cp_draft.pdf 
LOCATION:GS15\, Computer Laboratory
END:VEVENT
END:VCALENDAR