BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Computer Laboratory Programming Research Group Sem
 inar
SUMMARY:Monadic Constraint Programming - Tom Schrijvers (L
 euven)
DTSTART;TZID=Europe/London:20090619T151500
DTEND;TZID=Europe/London:20090619T161500
UID:TALK18851AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/18851
DESCRIPTION:A constraint programming system combines two essen
 tial components: a constraint solver and a search 
 engine. The constraint solver reasons about satisf
 iability of conjunctions of constraints\, and the 
 search engine controls the search for solutions by
  iteratively exploring a disjunctive search tree d
 efined by the constraint program. In this paper we
  give a monadic definition of constraint programmi
 ng 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 c
 lass objects that can themselves be built or exten
 ded by composable search transformers. Search tran
 sformers give a powerful and unifying approach to 
 viewing search in constraint programming\, and the
  resulting constraint programming system is first 
 class and extremely flexible.\n\nThis talk is base
 d on joint work with Peter Stuckey and Philip Wadl
 er\, recently accepted for publication by the Jour
 nal of Functional Programming:\nhttp://www.cs.kule
 uven.be/~toms/Research/papers/monadic_cp_draft.pdf
  
LOCATION:GS15\, Computer Laboratory
CONTACT:Dominic Orchard
END:VEVENT
END:VCALENDAR