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
相关论文
共 37 条
  • [1] GAMES AND FULL COMPLETENESS FOR MULTIPLICATIVE LINEAR LOGIC
    ABRAMSKY, S
    JAGADEESAN, R
    [J]. JOURNAL OF SYMBOLIC LOGIC, 1994, 59 (02) : 543 - 574
  • [2] ABRAMSKY S, 1995, IEEE S LOG, P234, DOI 10.1109/LICS.1995.523259
  • [3] ABRAMSKY S, INP RESS ESSAYS HONO
  • [4] ABRAMSKY S, 1999, IN PRESS INFORM COMP
  • [5] ABRAMSKY S, 1996, P 1996 WORKSH LIN LO, V3
  • [6] [Anonymous], THESIS U CAMBRIDGE
  • [7] [Anonymous], 1980, CALCULUS COMMUNICATI, DOI DOI 10.1007/3-540-10235-3
  • [8] BIERMAN G, 1995, LECT NOTES COMPUTER
  • [9] Borceux F., 1994, Handbook of Categorical Algebra, Encyclopedia of Mathematics and its Applications, V1
  • [10] Danos V., 1996, Proceedings. 11th Annual IEEE Symposium on Logic in Computer Science (Cat. No.96CH35952), P394, DOI 10.1109/LICS.1996.561456
1234