Full abstraction for Reduced ML

Full abstraction for Reduced ML
复制标题

DOI：
10.1016/j.apal.2013.05.007
复制
发表时间：
2009-03
期刊：
--
影响因子：
--
通讯作者：
A. Murawski;N. Tzevelekos
A. Murawski;N. Tzevelekos
中科院分区：
其他
文献类型：
--
作者：
A. Murawski;N. Tzevelekos

文献摘要

被引文献

相似文献

我们提出了Stark简化ML的第一个有效呈现的完全抽象模型，Stark简化ML是一种以整数值引用为特征的高阶编程语言。该模型采用名义博弈语义技术构建。它的独特之处在于，在游戏中存在着精心限制的关于商店的信息，并结合了参与者区分参考名称的能力。我们展示了它如何导致程序等价的显式表征。
We present the first effectively presentable fully abstract model for Starkʼs Reduced ML, a call-by-value higher-order programming language featuring integer-valued references. The model is constructed using techniques of nominal game semantics. Its distinctive feature is the presence of carefully restricted information about the store in plays, combined with conditions concerning the participantsʼ ability to distinguish reference names. We show how it leads to an explicit characterization of program equivalence.