Full abstraction for Idealized Algol with passive expressions

被引：22
|
作者：
Abramsky, S [1 ]
McCusker, G [1 ]
机构：
[1] Univ Edinburgh, Dept Comp Sci, Edinburgh EH9 3JZ, Midlothian, Scotland
来源：
THEORETICAL COMPUTER SCIENCE | 1999年 / 227卷 / 1-2期
关键词：
Algol-like languages; game semantics; full abstraction;
D O I：
10.1016/S0304-3975(99)00047-X
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A fully abstract games model of Reynolds' idealized Algol is described. The model gives a semantic account of the distinction between active types, such as commands, which admit side-effecting behaviour, and passive types, such as expressions, which do not. (C) 1999 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：3 / 42
页数：40
相关论文
共 50 条
12345