A graphical foundation for schedules

Cai Wingfield

(Bath)

In 2007, Harmer, Hyland and Melliès gave a formal mathematical foundation for game semantics using a notion they called a schedule. Their definition was combinatorial in nature, but researchers often draw pictures when describing schedules in practice. Moreover, a proof that the composition of schedules is associative involves cumbersome combinatorial detail, whereas in terms of pictures the proof is straightforward, reflecting the geometry of the plane. Here, we give a geometric formulation of schedule, show that it is equivalent to Harmer et al.’s definition, and illustrate its value by giving a proof of associativity of composition.
Thursday 22nd March 2012, 14:00
Far-134 (Video Conferencing Room)
Department of Computer Science