首页> 外文会议>Foundations of software science and computational structures >Least and Greatest Fixpoints in Game Semantics
【24h】

Least and Greatest Fixpoints in Game Semantics

机译:游戏语义的最小和最大固定点

获取原文
获取原文并翻译 | 示例

摘要

We show how solutions to many recursive arena equations can be computed in a natural way by allowing loops in arenas. We then equip arenas with winning functions and total winning strategies. We present two natural winning conditions compatible with the loop construction which respectively provide initial algebras and terminal coal-gebras for a large class of continuous functors. Finally, we introduce an intuitionistic sequent calculus, extended with syntactic constructions for least and greatest fixed points, and prove it has a sound and (in a certain weak sense) complete interpretation in our game model.
机译:我们展示了如何通过允许在舞台上循环来自然地计算许多递归舞台上方程的解。然后,我们为竞技场配备获胜功能和总获胜策略。我们提出了与环构造兼容的两个自然获胜条件,分别为大型连续函子提供了初始代数和末端煤代数。最后,我们介绍了一种直觉式的顺序演算,并用最小和最大不固定点的句法构造进行了扩展,并证明了它在我们的游戏模型中具有良好的(在某种意义上是较弱的)解释。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号