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:Category Theory Seminar
SUMMARY:Concurrent Games - Glynn Winskel\, Computer Labora
 tory\, University of Cambridge
DTSTART;TZID=Europe/London:20111122T141500
DTEND;TZID=Europe/London:20111122T151500
UID:TALK34576AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/34576
DESCRIPTION:I will present and motivate recent results on conc
 urrent games. These represent a situation in which
  a Player (or a team of players) compete against a
 n Opponent (a team of opponents)\, possibly in a h
 ighly distributed fashion. As usual the dichotomy 
 Player vs. Opponent can be interpreted in a variet
 y of ways\, as Process vs. Environment\, or Proof 
 vs. Refutation. Both games and nondeterministic co
 ncurrent strategies are represented by event struc
 tures\, a `partial-order model' of computation\, w
 ith an extra function expressing the polarity (the
  Player/Opponent nature) of each event. Although t
 his work has grown from the needs of semantics of 
 programming languages - I'll explain how - I belie
 ve it could have much more general interest.\n
LOCATION:MR5\, Centre for Mathematical Sciences
CONTACT:Julia Goedecke
END:VEVENT
END:VCALENDAR