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:Semantics Lunch (Computer Laboratory)
SUMMARY:An Invitation to Nominal Domain Theory - Andrew Pi
tts\, Computer Lab
DTSTART;TZID=Europe/London:20081020T124500
DTEND;TZID=Europe/London:20081020T140000
UID:TALK14769AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/14769
DESCRIPTION:The category of nominal sets provides a mathematic
al model of names and binding based on simple\, bu
t subtle ideas to do with permutations of names an
d "finitely supported" mathematical objects that f
irst arose in mathematical logic in the 1930s. Its
use underlies a number of recent works on names a
nd binding in computational logic\, automated reas
oning\, programming language design and operationa
l semantics. Relatively little use has been made o
f it for denotational semantics. Yet the key notio
n of finite support provides a syntax-independent
model of "free occurrence of names" that really co
mes into its own when considering the kind of infi
nite mathematical objects that arise in semantics
rather than syntax. So this talk will explain what
is known so far about "doing domain theory in the
category of nominal sets"\, in the hope that some
of the audience will be attracted to do some more
.
LOCATION:FW26
CONTACT:Matthew Parkinson
END:VEVENT
END:VCALENDAR