BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Transition systems over games - Paul Levy\, University of Birmingh
 am
DTSTART:20141128T160000Z
DTEND:20141128T170000Z
UID:TALK55999@talks.cam.ac.uk
CONTACT:Jonathan Hayman
DESCRIPTION:We describe a framework for game semantics combining operation
 al and denotational accounts. A game is a bipartite graph of\n“passive
 ” and “active” positions\, or a categorical variant with morphisms b
 etween positions.\n\nThe operational part of the framework is given by a l
 abelled\ntransition system in which each state sits in a particular positi
 on of\nthe game. From a state in a passive position\, transitions are labe
 lled\nwith a valid O-move from that position\, and take us to a state in\n
 the updated position. Transitions from states in an active position\nare l
 ikewise labelled with a valid P-move\, but silent transitions are\nallowed
 \, which must take us to a state in the same position.\n\nThe denotational
  part is given by a “transfer” from one game\nto another\, a kind of p
 rogram that converts moves between the two\ngames\, giving an operation on
  strategies. The agreement between\nthe two parts is given by a relation c
 alled a “stepped bisimulation”.\n\nThe framework is illustrated by an 
 example of substitution\nwithin a lambda-calculus.
LOCATION:Room FW26\, Computer Laboratory\, William Gates Building
END:VEVENT
END:VCALENDAR