A graphical foundation for schedules


McCusker, G., Power, J. and Wingfield, C., 2012. A graphical foundation for schedules. Electronic Notes in Theoretical Computer Science, 286, pp. 273-289.

Related documents:

PDF (8mar12.pdf) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (242kB) | Preview

    Official URL:


    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 Articles
    CreatorsMcCusker, G., Power, J. and Wingfield, C.
    DepartmentsFaculty of Science > Computer Science
    Publisher Statement8mar12.pdf: NOTICE: this is the author’s version of a work that was accepted for publication in Electronic Notes in Theoretical Computer Science. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Electronic Notes in Theoretical Computer Science, vol 286, 2012, DOI: 10.1016/j.entcs.2012.08.018
    ID Code30246
    Additional InformationProceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics (MFPS XXVIII)


    Actions (login required)

    View Item

    Document Downloads

    More statistics for this item...