Game-theoretic analysis of call-by-value computation
Game-theoretic analysis of call-by-value computation
复制标题
DOI：
10.1016/s0304-3975(99)00039-0
复制
发表时间：
1999-06-28
影响因子：
1.1
通讯作者：
Yoshida, N
中科院分区：
文献类型：
--
作者：
Honda, K;Yoshida, N
我们根据游戏语义元素提出了一个通用呼叫计算的一般语义宇宙，并通过完整的抽象结果来验证其作为语义宇宙的适当性，用于逐个呼叫PCF，这是一种通用的通用编程语言 - 价值评估。关键思想是将逐个名称和逐个呼叫之间的区别视为信息流的结构，这决定了游戏的基本形式。通过这种方式，逐个名称计算和呼叫计算作为具有不同代数结构的顺序函数计算的两个独立实例。我们按照领域理论的背景下开发的标准分类框架来阐明宇宙的类型结构。还阐明了提出的游戏类别与相应的呼叫宇宙之间的相互关系。 （c）1999 Elsevier Science B.V.保留所有权利。
We present a general semantic universe of call-by-value computation based on elements of game semantics, and validate its appropriateness as a semantic universe by the full abstraction result for call-by-value PCF, a generic typed programming language with call-by-value evaluation. The key idea is to consider the distinction between call-by-name and call-by-value as that of the structure of information flow, which determines the basic form of games. In this way the call-by-name computation and call-by-value computation arise as two independent instances of sequential functional computation with distinct algebraic structures. We elucidate the type structures of the universe following the standard categorical framework developed in the context of domain theory. Mutual relationship between the presented category of games and the corresponding call-by-name universe is also clarified. (C) 1999 Elsevier Science B.V. All rights reserved.