Abstract machines for dialogue games - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 2009

Abstract machines for dialogue games


The notion of abstract Boehm tree has arisen as an operationally-oriented distillation of works on game semantics, and has been investigated in two papers. This paper revisits the notion, providing more syntactic support and more examples (like call-by-value evaluation) illustrating the generality of the underlying computing device. Precise correspondences between various formulations of the evaluation mechanism of abstract Boehm trees are established.
Fichier principal
Vignette du fichier
Panorama.pdf (337.93 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-00155295 , version 1 (18-06-2007)



Pierre-Louis Curien, Hugo Herbelin. Abstract machines for dialogue games. Interactive models of computation and program behavior, Société Mathématique de France, pp.231-275, 2009, Panoramas et Synthèses. ⟨hal-00155295⟩
346 View
64 Download



Gmail Mastodon Facebook X LinkedIn More