Abstract machines for dialogue games
Pierre-Louis Curien (PPS), Hugo Herbelin (INRIA Futurs)
TL;DR
This paper revisits the concept of abstract Boehm trees, enhancing its syntactic framework and illustrating its broad applicability through examples like call-by-value evaluation, while establishing formal correspondences between different evaluation mechanisms.
Contribution
It provides a more syntactic formulation of abstract Boehm trees and demonstrates their generality with new examples and formal evaluation correspondences.
Findings
Enhanced syntactic support for abstract Boehm trees
Illustrated applicability with call-by-value evaluation
Established formal correspondences between evaluation mechanisms
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Artificial Intelligence in Games · Logic, Reasoning, and Knowledge