![]() |
![]() |
University of Birmingham > Talks@bham > Theoretical computer science seminar > Innocent Strategies are Sheaves over Plays
Innocent Strategies are Sheaves over PlaysAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Neel Krishnaswami. Although the HO/N games are fully abstract for PCF , the traditional notion of innocence (which underpins these games) is not satisfactory for such language features as non-determinism and probabilistic branching, in that there are stateless terms that are not innocent. Based on a category of P-visible plays with a notion of embedding as morphisms, we propose a natural generalisation by viewing innocent strategies as sheaves over (a site of) plays, echoing a slogan of Hirschowitz and Pous. Our approach gives rise to fully complete game models in each of the three cases of deterministic, nondeterministic and probabilistic branching. To our knowledge, in the second and third cases, ours are the first such factorisation-free constructions. 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 listsTopology and Dynamics Seminar Optimisation and Numerical Analysis Seminars Cold AtomsOther talksModelling uncertainty in image analysis. Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems Quantum simulations using ultra cold ytterbium Ultrafast, all-optical, and highly efficient imaging of molecular chirality TBC Sensing and metrology activities at NPL, India |