Abstract machines for dialogue games

Pierre-Louis Curien (1) , Hugo Herbelin (2)

1 PPS - Preuves, Programmes et Systèmes
2 LOGICAL - Logic and computing

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.

Mots clés: lambda-calcul; sémantique des jeux

Domaines: Logique en informatique [cs.LO]

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⟩