Abstract machines for dialogue games
| dc.creator | Curien, Pierre-Louis | |
| dc.creator | Herbelin, Hugo | |
| dc.date | 2007-06-18 | |
| dc.date.accessioned | 2026-07-07T08:10:45Z | |
| dc.date.available | 2026-07-07T08:10:45Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/0706.2544 | |
| dc.identifier | http://arxiv.org/abs/0706.2544 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/131912 | |
| dc.subject | Logic in Computer Science | |
| dc.title | Abstract machines for dialogue games | |
| dc.type | text |