Skip to Main content Skip to Navigation
Book sections

Abstract machines for dialogue games

Pierre-Louis Curien 1, * Hugo Herbelin 2, *
* Corresponding author
2 LOGICAL - Logic and computing
UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, X - École polytechnique, CNRS - Centre National de la Recherche Scientifique : UMR8623
Abstract : 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.
Document type :
Book sections
Complete list of metadatas

Cited literature [31 references]  Display  Hide  Download
Contributor : Pierre-Louis Curien <>
Submitted on : Monday, June 18, 2007 - 9:24:40 AM
Last modification on : Tuesday, April 21, 2020 - 1:08:57 AM
Document(s) archivé(s) le : Thursday, April 8, 2010 - 5:41:28 PM


Files produced by the author(s)


  • HAL Id : hal-00155295, version 1
  • ARXIV : 0706.2544



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⟩



Record views


Files downloads