![]() |
![]() |
University of Birmingham > Talks@bham > Theoretical computer science seminar > Dynamic games and strategies
Dynamic games and strategiesAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Neel Krishnaswami. In this talk, I propose a variant of game semantics to capture ``intensionality’’ in computation, particularly the (syntactic) normalization process syntax-independently. For this purpose, I introduce a distinction between ``external’’ and ``internal’’ moves and the so-called hiding-operation in game semantics, resulting in a ``dynamic’’ variant of games and strategies. It can be seen as a model of computation, in which computational processes are formulated as mathematical objects, and as a semantic counterpart of call-by-value computation. I also study its categorical and algebraic structures: Categorically, dynamic games and strategies give rise to a cartesian closed bicategory, in which the existing operations on games and strategies are generalized. I conclude the talk by mentioning some future work such as a categorical generalization and applications to intentional type theory. This talk is part of the Theoretical computer science seminar series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsFeatured lists Geometry and Mathematical Physics seminar Condensed Matter Physics SeminarsOther talksTBA TBA TBC Life : it’s out there, but what and why ? Quantum Sensing in Space TBA |