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 条
  • [1] ABSTRACTION AND DEFINABILITY IN SEMANTICALLY CLOSED STRUCTURES
    MCCARTHY, T
    JOURNAL OF PHILOSOPHICAL LOGIC, 1985, 14 (03) : 255 - 266
  • [2] Full Satisfaction Classes, Definability, and Automorphisms
    Wcislo, Bartosz
    NOTRE DAME JOURNAL OF FORMAL LOGIC, 2022, 63 (02) : 143 - 163
  • [3] Full abstraction for Gamma
    Quiroz, FH
    PROCEEDINGS OF THE FIFTH MEXICAN INTERNATIONAL CONFERENCE IN COMPUTER SCIENCE (ENC 2004), 2004, : 20 - 26
  • [4] Full abstraction for Linda
    Di Giusto, Cinzia
    Gabbrielli, Maurizio
    PROGRAMMING LANGUAGES AND SYSTEMS, PROCEEDINGS, 2008, 4960 : 78 - 92
  • [5] Full abstraction for HOPLA
    Nygaard, M
    Winske, G
    CONCUR 2003 - CONCURRENCY THEORY, 2003, 2761 : 383 - 398
  • [6] Full abstraction by translation
    McCusker, G
    ADVANCES IN THEORY AND FORMAL METHODS OF COMPUTING, 1996, : 252 - 263
  • [7] FULL ABSTRACTION AND RECURSION
    MISLOVE, MW
    OLES, FJ
    THEORETICAL COMPUTER SCIENCE, 1995, 151 (01) : 207 - 256
  • [8] Full abstraction for PCF
    Abramsky, S
    Jagadeesan, R
    Malacaria, P
    INFORMATION AND COMPUTATION, 2000, 163 (02) : 409 - 470
  • [9] Full abstraction for polymorphic π-calculus
    Jeffrey, Alan
    Rathke, Julian
    THEORETICAL COMPUTER SCIENCE, 2008, 390 (2-3) : 171 - 196
  • [10] General conditions for full abstraction
    Parrow, Joachim
    MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2016, 26 (04) : 655 - 657
12345