BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Weighted relational models of typed lambda-calculi - Guy McCusker\
 , University of Bath
DTSTART:20131115T160000Z
DTEND:20131115T170000Z
UID:TALK46509@talks.cam.ac.uk
CONTACT:Jonathan Hayman
DESCRIPTION:The category Rel of sets and relations yields one of the simpl
 est denotational semantics of Linear Logic. Rel can be viewed as the bipro
 duct completion of the Boolean ring. We consider the generalization of thi
 s construction to arbitrary continuous semirings\, producing categories th
 at provide cpo-enriched models of linear logic akin to Rel\, and investiga
 te models of PCF in their co-Kleisli categories. These models contain quan
 titative information\, provided by the elements of the semiring R. Specifi
 c instances of R allow us to compare programs not only with respect to “
 what they can do”\, but also “in how many steps” or “in how many d
 ifferent ways” (for non-deterministic PCF) or even “with what probabil
 ity” (for probabilistic PCF).\n\nJoint work with Jim Laird (Bath) and Gi
 ulio Manzonetto and Michele Pagani (LIPN\, Paris-Nord)
LOCATION:Auditorium\, Microsoft Research Ltd\, 21 Station Road\, Cambridge
 \, CB1 2FB
END:VEVENT
END:VCALENDAR