Types and full abstraction for polyadic π-calculus

被引：8
|
作者：
Quaglia, P [1 ]
Walker, D
机构：
[1] Univ Trent, Dip Informat & Telecommun, I-38100 Trento, Italy
[2] Univ Oxford, Comp Lab, Oxford OX1 3QD, England
来源：
INFORMATION AND COMPUTATION | 2005年 / 200卷 / 02期
关键词：
D O I：
10.1016/j.ic.2005.03.004
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A type system for terms of the monadic pi-calculus is introduced and used to obtain a full-abstraction result for the translation of the polyadic pi-calculus into the monadic calculus: well-sorted terms of the polyadic calculus are barbed congruent iff their translations are typed barbed congruent. (c) 2005 Elsevier Inc. All rights reserved.
引用
收藏
页码：215 / 246
页数：32
相关论文
共 50 条
  • [41] A HIGHER-ORDER CALCULUS AND THEORY ABSTRACTION
    LUO, ZH
    INFORMATION AND COMPUTATION, 1991, 90 (01) : 107 - 137
  • [42] Agent Abstraction via Forgetting in the Situation Calculus
    Luo, Kailun
    Liu, Yongmei
    Lesperanc, Yves
    Lin, Ziliang
    ECAI 2020: 24TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2020, 325 : 809 - 816
  • [43] General conditions for full abstraction
    Parrow, Joachim
    MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2016, 26 (04) : 655 - 657
  • [44] Full Abstraction for Reduced ML
    Murawski, Andrzej S.
    Tzevelekos, Nikos
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES, PROCEEDINGS, 2009, 5504 : 32 - 47
  • [45] On Feller Continuity and Full Abstraction
    Barthe, Gilles
    Crubille, Raphaelle
    Dal Lago, Ugo
    Gavazzo, Francesco
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2022, 6 (ICFP):
  • [46] Full abstraction and the Context Lemma
    Jim, T
    Meyer, AR
    SIAM JOURNAL ON COMPUTING, 1996, 25 (03) : 663 - 696
  • [47] Full Abstraction for Probabilistic PCF
    Ehrhard, Thomas
    Pagani, Michele
    Tasson, Christine
    JOURNAL OF THE ACM, 2018, 65 (04)
  • [48] Games and full abstraction for FPC
    McCusker, G
    INFORMATION AND COMPUTATION, 2000, 160 (1-2) : 1 - 61
  • [49] Full abstraction for Reduced ML
    Murawski, Andrzej S.
    Tzevelekos, Nikos
    ANNALS OF PURE AND APPLIED LOGIC, 2013, 164 (11) : 1118 - 1143
  • [50] On Timed Models and Full Abstraction
    Lowe, Gavin
    Ouaknine, Joel
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2006, 155 : 497 - 519
12345