arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0910.5399cs.LO
收藏

命令计算的图模型

A Graph Model for Imperative Computation

Guy McCusker

摘要:

斯科特的图模型是一个基于观察的闭代数,即自然数集合的格上的连续内函数可以通过它们的图来表示。图是将有限组输入值映射到输出值的关系。我们考虑一个类似的模型的基础上的关系,其输入值是有限的序列,而不是集。这种改变意味着我们考虑了观测的顺序。这个新的概念图产生了一个模型的仿射代数演算,承认的解释,包括变量分配,解引用和分配的命令式结构。扩展这个无类型的模型,我们构建了一个类别,提供了一个模型的类型高阶命令式计算与仿射类型系统。这类语言的一个恰当的例子是雷诺兹的《干涉的句法控制》。我们的模型对于这种语言来说是完全抽象的。在具体层面上,它与Reddy的对象空间模型相同,后者是高阶命令式程序设计语言的第一个“无状态”模型,也是游戏模型的重要先驱。因此,图模型可以被看作是Reddy模型的通用域。

英文摘要:

Scott's graph model is a lambda-algebra based on the observation that continuous endofunctions on the lattice of sets of natural numbers can be represented via their graphs. A graph is a relation mapping finite sets of input values to output values. We consider a similar model based on relations whose input values are finite sequences rather than sets. This alteration means that we are taking into account the order in which observations are made. This new notion of graph gives rise to a model of affine lambda-calculus that admits an interpretation of imperative constructs including variable assignment, dereferencing and allocation. Extending this untyped model, we construct a category that provides a model of typed higher-order imperative computation with an affine type system. An appropriate language of this kind is Reynolds's Syntactic Control of Interference. Our model turns out to be fully abstract for this language. At a concrete level, it is the same as Reddy's object spaces model, which was the first "state-free" model of a higher-order imperative programming language and an important precursor of games models. The graph model can therefore be seen as a universal domain for Reddy's model.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑