Abstract
A new characterization of nondeterministic concurrent strategies exhibits strategies as certain discrete fibrations—or equivalently presheaves—over configurations of the game. This leads to a lax functor from the bicategory of strategies to the bicategory of profunctors. The lax functor expresses how composition of strategies is obtained from that of profunctors by restricting to ‘reachable’ elements, which gives an alternative formulation of the composition of strategies. It provides a fundamental connection—and helps explain the mismatches—between two generalizations of domain theory to forms of intensional domain theories, one based on games and strategies, and the other on presheaf categories and profunctors. In particular cases, on the sub-bicategory of rigid strategies which includes ‘simple games’ (underlying AJM and HO games), and stable spans (specializing to Berry’s stable functions, in the deterministic case), the lax functor becomes a pseudo functor. More generally, the laxness of the functor suggests what structure is missing from categories and profunctors in order that they can be made to support the operations of games and strategies. By equipping categories with the structure of a ‘rooted’ factorization system and ensuring all elements of profunctors are ‘reachable,’ we obtain a pseudo functor embedding the bicategory of strategies in the bicategory of reachable profunctors. This shift illuminates early work on bistructures and bidomains, where the Scott order and Berry’s stable order are part of a factorization system, giving a sense in which bidomains are games.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Rideau, S., Winskel, G.: Concurrent strategies. In: LICS 2011. IEEE Computer Society (2011)
Hyland, M.: Some reasons for generalising domain theory. Mathematical Structures in Computer Science 20(2), 239–265 (2010)
Winskel, G.: Events, causality and symmetry. Comput. J. 54(1), 42–57 (2011)
Abramsky, S., Jagadeesan, R., Malacaria, P.: Full abstraction for PCF. Inf. Comput. 163(2), 409–470 (2000)
Hyland, J.M.E., Ong, C.H.L.: On full abstraction for PCF: I, II, and III. Inf. Comput. 163(2), 285–408 (2000)
Cattani, G.L., Winskel, G.: Profunctors, open maps and bisimulation. Mathematical Structures in Computer Science 15(3), 553–614 (2005)
Joyal, A.: Remarques sur la théorie des jeux à deux personnes. Gazette des sciences mathématiques du Québec 1(4) (1997)
Hyland, M.: Game semantics. In: Pitts, A., Dybjer, P. (eds.) Semantics and Logics of Computation. Publications of the Newton Institute (1997)
Harmer, R., Hyland, M., Melliès, P.A.: Categorical combinatorics for innocent strategies. In: LICS 2007. IEEE Computer Society (2007)
Joyal, A.: Factorization systems. Joyal’s CatLab (2012), http://ncatlab.org/joyalscatlab/
Curien, P.L., Plotkin, G.D., Winskel, G.: Bistructures, bidomains, and linear logic. In: Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 21–54. MIT Press (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Winskel, G. (2013). Strategies as Profunctors. In: Pfenning, F. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2013. Lecture Notes in Computer Science, vol 7794. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37075-5_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-37075-5_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37074-8
Online ISBN: 978-3-642-37075-5
eBook Packages: Computer ScienceComputer Science (R0)