On full abstraction for PCF: I, II, and III
Information and Computation
Information and Computation
Games on Graphs and Sequentially Realizable Functionals
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Semantics of Interaction (Abstract)
CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
Games and Full Completeness for Multiplicative Linear Logic (Extended Abstract)
Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
Categorical Combinatorics for Innocent Strategies
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
The anatomy of innocence revisited
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Functorial boxes in string diagrams
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
| Hi-index | 0.00 |
In 2007, Harmer, Hyland and Mellies 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.