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:Logic and Semantics Seminar (Computer Laboratory)
SUMMARY:Weighted relational models of typed lambda-calculi
- Guy McCusker\, University of Bath
DTSTART;TZID=Europe/London:20131115T160000
DTEND;TZID=Europe/London:20131115T170000
UID:TALK46509AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/46509
DESCRIPTION:The category Rel of sets and relations yields one
of the simplest denotational semantics of Linear L
ogic. Rel can be viewed as the biproduct completio
n of the Boolean ring. We consider the generalizat
ion of this construction to arbitrary continuous s
emirings\, producing categories that provide cpo-e
nriched models of linear logic akin to Rel\, and i
nvestigate models of PCF in their co-Kleisli categ
ories. These models contain quantitative informati
on\, provided by the elements of the semiring R. S
pecific instances of R allow us to compare program
s not only with respect to “what they can do”\, bu
t also “in how many steps” or “in how many differe
nt ways” (for non-deterministic PCF) or even “with
what probability” (for probabilistic PCF).\n\nJoi
nt work with Jim Laird (Bath) and Giulio Manzonett
o and Michele Pagani (LIPN\, Paris-Nord)
LOCATION:Auditorium\, Microsoft Research Ltd\, 21 Station R
oad\, Cambridge\, CB1 2FB
CONTACT:Jonathan Hayman
END:VEVENT
END:VCALENDAR