Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 273-289 |
| Number of pages | 16 |
| Journal | Electronic Notes in Theoretical Computer Science |
| Volume | 286 |
| DOIs | |
| Publication status | Published - 24 Sept 2012 |
Bibliographical note
Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics (MFPS XXVIII)Fingerprint
Dive into the research topics of 'A graphical foundation for schedules'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS