BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Supercompilation by evaluation - Max Bolingbroke
DTSTART:20100716T141500Z
DTEND:20100716T151500Z
UID:TALK25538@talks.cam.ac.uk
CONTACT:Dominic Orchard
DESCRIPTION:Supercompilation is a powerful program transformation techniqu
 e which\ncan be used to both automatically prove theorems about programs a
 nd\ngreatly improve the efficiency with which they execute. Despite its\nr
 emarkable power\, the transformation is simple\, principled and fully\naut
 omatic. Supercompilation is closely related to partial evaluation\,\nbut c
 an achieve strictly more optimising transformations.\n\nI intend to give a
 n introduction to supercompilation for those new to\nthe topic\, using the
  framework from our recently accepted Haskell\nSymposium paper. I will als
 o discuss the difficulties involved in\nextending the algorithm to a langu
 age with recursive let bindings\, and\nhow we can use well-known technique
 s from operational semantics to\nsolve them. Time allowing\, I will discus
 s the surprising issues raised\nwhen building supercompilers for a call-by
 -value language.
LOCATION:GS15\, Computer Laboratory
END:VEVENT
END:VCALENDAR