Introduction to higher order categorical logic
Introduction to higher order categorical logic
Theoretical Computer Science
On full abstraction for PCF: I, II, and III
Information and Computation
Information and Computation
Completeness of continuation models for λµ-calculus
Information and Computation - Special issue: LICS'97
Control categories and duality: on the categorical semantics of the lambda-mu calculus
Mathematical Structures in Computer Science
Asynchronous games 2: the true concurrency of innocence
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
A quantum double construction in rel
Mathematical Structures in Computer Science
| Hi-index | 0.00 |
A dialogue category is a symmetric monoidal category equipped with a notion of tensorial negation. We establish that the free dialogue category is a category of dialogue games and total innocent strategies. The connection clarifies the algebraic and logical nature of dialogue games, and their intrinsic connection to linear continuations. The proof of the statement is based on an algebraic presentation of dialogue categories inspired by knot theory, and a factorization theorem established by rewriting techniques.