Abstract machines for dialogue games
Logic in Computer Science
2007-06-19 v1
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.
Cite
@article{arxiv.0706.2544,
title = {Abstract machines for dialogue games},
author = {Pierre-Louis Curien and Hugo Herbelin},
journal= {arXiv preprint arXiv:0706.2544},
year = {2007}
}