A fully abstract game semantics for general references

A fully abstract game semantics for general references
复制标题

完全抽象的游戏语义，供一般参考

DOI：
--
复制
发表时间：
1998
期刊：
Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226)
影响因子：
--
通讯作者：
G. McCusker
G. McCusker
中科院分区：
--
文献类型：
--
作者：
S. Abramsky;Kohei Honda;G. McCusker

文献摘要

被引文献

相似文献

介绍了一种具有ML引用形式的高阶存储的程序设计语言的博弈模型。用于模型的类别是通过放松某些行为条件的一类游戏，以前用于提供完全抽象的纯函数语言的模型。该模型被证明是完全抽象的因子分解参数，减少了问题的可定义性的语言与高阶存储，其纯粹的功能片段。
A games model of a programming language with higher-order store in the style of ML-references is introduced. The category used for the model is obtained by relaxing certain behavioural conditions on a category of games previously used to provide fully abstract models of pure functional languages. The model is shown to be fully abstract by means of factorization arguments which reduce the question of definability for the language with higher-order store to that for its purely functional fragment.