Definability and Full Abstraction

被引：21
|
作者：
Curien, Pierre-Louis [1 ,2 ]
机构：
[1] CNRS, PPS, Paris, France
[2] Univ Paris 07, Paris, France
来源：
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE | 2007年 / 172卷
关键词：
operational semantics; denotational semantics; sequentiality;
D O I：
10.1016/j.entcs.2007.02.011
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Game semantics has renewed denotational semantics. It offers among other things an attractive classification of programming features, and has brought a bunch of new definability results. In parallel, in the denotational semantics of proof theory, several full completeness results have been shown since the early nineties. In this note, we review the relation between definability and full abstraction, and we put a few old and recent results of this kind in perspective.
引用
收藏
页码：301 / 310
页数：10
相关论文
共 50 条
12345