Coherence for lenses and open games
arXiv:1704.02230
Abstract
Categories of polymorphic lenses in computer science, and of open games in compositional game theory, have a curious structure that is reminiscent of compact closed categories, but differs in some crucial ways. Specifically they have a family of morphisms that behave like the counits of a compact closed category, but have no corresponding units; and they have a `partial' duality that behaves like transposition in a compact closed category when it is defined. We axiomatise this structure, which we refer to as a `teleological category'. We precisely define a diagrammatic language suitable for these categories, and prove a coherence theorem for them. This underpins the use of diagrammatic reasoning in compositional game theory, which has previously been used only informally.
References in corpus (1)
Cited by in corpus (9)
- Open Diagrams via Coend Calculus
- Generalized Lens Categories via functors
- Bayesian open games
- Compositional Deep Learning
- Limits of bimorphic lenses
- Towards Functorial Language-Games
- Functorial Language Games for Question Answering
- The algebra of predicting agents
- Monoidal Structures on Generalized Polynomial Categories