Game semantics as a singular functor, and definability as geometric realisation - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2017

Game semantics as a singular functor, and definability as geometric realisation

Résumé

Game semantics is a class of models of programming languages in which types are interpreted as games and programs as strategies. Though originally designed for sequential languages, its scope has recently been extended to concurrent ones. A salient feature of game semantics is the notion of innocence, which requires strategies to be determined by their values on a certain class of plays, called views. In previous work, we have obtained a representation theorem for Tsukada and Ong's categories of views and plays, in particular by constructing an embedding V of views into a coslice of a certain presheaf category. We here exploit this result to exhibit an efficient categorical account of two crucial constructions of game semantics. First, we recover the interpretation of normal forms into innocent strategies as the singular functor associated to V. Second, the corresponding geometric realisation functor yields the standard definability result saying that any innocent strategy is (isomorphic to) the interpretation of a normal form.
Fichier principal
Vignette du fichier
yoneda-hal.pdf (126.94 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01527171 , version 1 (24-05-2017)

Identifiants

  • HAL Id : hal-01527171 , version 1

Citer

Clovis Eberhart, Tom Hirschowitz. Game semantics as a singular functor, and definability as geometric realisation. 2017. ⟨hal-01527171⟩
165 Consultations
111 Téléchargements

Partager

Gmail Facebook X LinkedIn More