无辜策略是博弈的一个整体--确定性、非确定性和概率无辜
Innocent Strategies are Sheaves over Plays---Deterministic, Non-deterministic and Probabilistic Innocence
摘要:
虽然HO/N游戏对于PCF来说是完全抽象的,但传统的无罪概念(支撑这些游戏)对于非确定性和概率分支等语言特征并不令人满意,因为存在非无罪的无状态术语。基于一类的P-可见的发挥与嵌入的概念作为态射,我们提出了一个自然的概括,通过查看无辜的策略,作为一个网站上的(一个)发挥,呼应的口号Hirschowitz和Pous。我们的方法在确定性,非确定性和概率分支的三种情况下都产生了完全完整的博弈模型。据我们所知,在第二和第三种情况下,我们是第一个这样的无因式分解的结构。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。