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 条
  • [1] Full Abstraction in a Subtyped pi-Calculus with Linear Types
    Demangeon, Romain
    Honda, Kohei
    CONCUR 2011: CONCURRENCY THEORY, 2011, 6901 : 280 - 296
  • [2] Full abstraction for polymorphic π-calculus
    Jeffrey, Alan
    Rathke, Julian
    THEORETICAL COMPUTER SCIENCE, 2008, 390 (2-3) : 171 - 196
  • [3] Full Abstraction for the Quantum Lambda-Calculus
    Clairambault, Pierre
    de Visme, Marc
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2020, 4 (POPL):
  • [4] Full abstraction for polymorphic Pi-calculus
    Jeffrey, A
    Rathke, J
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PROCEEDINGS, 2005, 3441 : 266 - 281
  • [5] FULL ABSTRACTION IN THE LAZY LAMBDA-CALCULUS
    ABRAMSKY, S
    ONG, CHL
    INFORMATION AND COMPUTATION, 1993, 105 (02) : 159 - 267
  • [6] Object connectivity and full abstraction for a concurrent calculus of classes
    Abrahám, E
    Bonsangue, MM
    de Boer, FS
    Steffen, M
    THEORETICAL ASPECTS OF COMPUTING - ICTAC 2004, 2005, 3407 : 37 - 51
  • [7] Nominal games and full abstraction for the nu-calculus
    Abramsky, S
    Ghica, DR
    Murawski, AS
    Ong, CHL
    Stark, IDB
    19TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2004, : 150 - 159
  • [8] THE POLYADIC PI-CALCULUS
    MILNER, R
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 630 : 1 - 1
  • [9] Full intersection types and topologies in lambda calculus
    Ghilezan, S
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2001, 62 (01) : 1 - 14
  • [10] When not losing is better than winning:: Abstraction and refinement for the full μ-calculus
    Grumberg, Orna
    Lange, Martin
    Leucker, Martin
    Shoham, Sharon
    INFORMATION AND COMPUTATION, 2007, 205 (08) : 1130 - 1148
12345