TY - JOUR

T1 - A graphical foundation for schedules

AU - McCusker, Guy

AU - Power, John

AU - Wingfield, Cai

N1 - Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics (MFPS XXVIII)

PY - 2012/9/24

Y1 - 2012/9/24

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84856203520&partnerID=8YFLogxK

UR - http://dx.doi.org/10.1016/j.entcs.2012.08.018

U2 - 10.1016/j.entcs.2012.08.018

DO - 10.1016/j.entcs.2012.08.018

M3 - Article

SN - 1571-0661

VL - 286

SP - 273

EP - 289

JO - Electronic Notes in Theoretical Computer Science

JF - Electronic Notes in Theoretical Computer Science

ER -