On Applicative Similarity, Sequentiality, and Full Abstraction

被引：7
|
作者：
Crubille, Raphaelle [1 ]
Dal Lago, Ugo [2 ,3 ]
Sangiorgi, Davide [2 ,3 ]
Vignudelli, Valeria [2 ,3 ]
机构：
[1] ENS Lyon, Lyon, France
[2] Univ Bologna, Bologna, Italy
[3] INRIA, Bologna, Italy
来源：
CORRECT SYSTEM DESIGN: SYMPOSIUM IN HONOR OF ERNST-RUDIGER OLDEROG ON THE OCCASION OF HIS 60TH BIRTHDAY | 2015年 / 9360卷
关键词：
Probabilistic lambda calculus; Bisimulation; Coinduction; Sequentiality; BISIMULATION;
D O I：
10.1007/978-3-319-23506-6_7
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We study how applicative bisimilarity behaves when instantiated on a call-by-value probabilistic lambda-calculus, endowed with Plotkin's parallel disjunction operator. We prove that congruence and coincidence with the corresponding context relation hold for both bisimilarity and similarity, the latter known to be impossible in sequential languages.
引用
收藏
页码：65 / 82
页数：18
相关论文
共 50 条
  • [1] Applicative Abstract Categorial Grammars in Full Swing
    Kiselyov, Oleg
    [J]. NEW FRONTIERS IN ARTIFICIAL INTELLIGENCE, 2017, 10091 : 66 - 78
  • [2] Full abstraction for Gamma
    Quiroz, FH
    [J]. PROCEEDINGS OF THE FIFTH MEXICAN INTERNATIONAL CONFERENCE IN COMPUTER SCIENCE (ENC 2004), 2004, : 20 - 26
  • [3] Definability and Full Abstraction
    Curien, Pierre-Louis
    [J]. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2007, 172 : 301 - 310
  • [4] Full abstraction for Linda
    Di Giusto, Cinzia
    Gabbrielli, Maurizio
    [J]. PROGRAMMING LANGUAGES AND SYSTEMS, PROCEEDINGS, 2008, 4960 : 78 - 92
  • [5] Full abstraction for HOPLA
    Nygaard, M
    Winske, G
    [J]. CONCUR 2003 - CONCURRENCY THEORY, 2003, 2761 : 383 - 398
  • [6] Full abstraction by translation
    McCusker, G
    [J]. ADVANCES IN THEORY AND FORMAL METHODS OF COMPUTING, 1996, : 252 - 263
  • [7] FULL ABSTRACTION AND RECURSION
    MISLOVE, MW
    OLES, FJ
    [J]. THEORETICAL COMPUTER SCIENCE, 1995, 151 (01) : 207 - 256
  • [8] Full abstraction for PCF
    Abramsky, S
    Jagadeesan, R
    Malacaria, P
    [J]. INFORMATION AND COMPUTATION, 2000, 163 (02) : 409 - 470
  • [9] Effectful applicative similarity for call-by-name lambda calculi
    Dal Lago, Ugo
    Gavazzo, Francesco
    Tanaka, Ryo
    [J]. THEORETICAL COMPUTER SCIENCE, 2020, 813 : 234 - 247
  • [10] General conditions for full abstraction
    Parrow, Joachim
    [J]. MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2016, 26 (04) : 655 - 657
12345