具有对称性的薄博弈与并发Hyland-Ong博弈
Thin Games with Symmetry and Concurrent Hyland-Ong Games
AI总结:
本文基于事件结构构建笛卡尔闭范畴Cho,以精细解释高阶有状态并发程序,兼具Hyland-Ong博弈的保守性与更强表达力,并应用于理想化并行Algol。
摘要:
我们基于事件结构构建了一个笛卡尔闭范畴,称为Cho。它允许对高阶有状态并发程序进行精细且精确的解释:一方面,当将纯函数式程序解释为无邪策略时,它与标准的Hyland-Ong博弈是保守的;另一方面,它的表达能力更强。程序的解释组合地构造了其执行的表示,该表示展示了因果依赖关系并记住了非确定性分支的点。该构造分两个阶段进行。首先,我们构建了一个紧致闭范畴Tcg。它是Rideau和Winskel的范畴CG的一个变体,区别在于Tcg中的博弈和策略配备了对称性,以表达某些事件本质上是相同的。这类似于AJM博弈的底层范畴,通过等价关系丰富了简单博弈的玩法。在此基础上,我们构建了笛卡尔闭范畴Cho,其对象为Hyland-Ong博弈的标准竞技场,策略由某些事件结构表示,在作为这些竞技场的展开形式获得的具有对称性的博弈上进行。为了说明这些构造并赋予其操作性的启示,我们在Cho中解释了理想化并行Algol(的一个紧密变体)。
英文摘要:
We build a cartesian closed category, called Cho, based on event structures. It allows an interpretation of higher-order stateful concurrent programs that is refined and precise: on the one hand it is conservative with respect to standard Hyland-Ong games when interpreting purely functional programs as innocent strategies, while on the other hand it is much more expressive. The interpretation of programs constructs compositionally a representation of their execution that exhibits causal dependencies and remembers the points of non-deterministic branching.The construction is in two stages. First, we build a compact closed category Tcg. It is a variant of Rideau and Winskel's category CG, with the difference that games and strategies in Tcg are equipped with symmetry to express that certain events are essentially the same. This is analogous to the underlying category of AJM games enriching simple games with an equivalence relations on plays. Building on this category, we construct the cartesian closed category Cho as having as objects the standard arenas of Hyland-Ong games, with strategies, represented by certain events structures, playing on games with symmetry obtained as expanded forms of these arenas.To illustrate and give an operational light on these constructions, we interpret (a close variant of) Idealized Parallel Algol in Cho.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。