BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:The Constraint Handling Rules (CHR) language - Tom Schrijvers\, Ca
 tholic University of Leuven
DTSTART:20080118T151500Z
DTEND:20080118T161500Z
UID:TALK9929@talks.cam.ac.uk
CONTACT:Alan Mycroft
DESCRIPTION:Constraint Handling Rules (CHR) is a multi-set rewriting langu
 age created in the early nineties. While originally designed for writing c
 onstraint  solvers\, the expressivity of its multi-headed rewrite rules ha
 s been appreciated in a wide range of applications: planning\, type checki
 ng\, business rules\, ...\n\nCHR implementation is an active topic of rese
 arch. A stack-based compilation scheme allows for efficient compilation to
  conventional programming languages. Thanks to program analysis and approp
 riate indexing data structures for multi-headed matching\, any algorithm c
 an be implemented with optimal time and space complexity. As far as we kno
 w\, this result has not been obtained in the pure fragment of other declar
 ative language implementations.\n\nThis talk gives an overview of the CHR 
 language\, applications and interesting implementation results.\n\nTom Sch
 rijvers is a post-doctoral researcher at the Department of Computer  Scien
 ce at the Catholic University of Leuven. He obtained his Ph.D. on "Analyse
 s\, Optimizations and Extensions of Constraint Handling Rules" in  2005 an
 d is the lead developer of the K.U.Leuven CHR system\, which is  distribut
 ed with major Prolog systems.\n
LOCATION:GS15\, Computer Laboratory
END:VEVENT
END:VCALENDAR