A graphical foundation for schedules

McCusker, Guy and Power, John and Wingfield, Cai (2012) A graphical foundation for schedules. Electronic Notes in Theoretical Computer Science, 286. pp. 273-289. ISSN 1571-0661

Full text not available from this repository.


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, prove that it is equivalent to Harmer et al.ʼs definition, and illustrate its value by giving a proof of associativity of composition.

Item Type:
Journal Article
Journal or Publication Title:
Electronic Notes in Theoretical Computer Science
Uncontrolled Keywords:
ID Code:
Deposited By:
Deposited On:
09 Jun 2017 09:10
Last Modified:
22 Nov 2022 04:44