Semantics of name and value passing

被引：60
作者：
Fiore, M [1 ]
Turi, D [1 ]
机构：
[1] Univ Cambridge, Comp Lab, Cambridge CB2 1TN, England
来源：
16TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS | 2001年
关键词：
D O I：
10.1109/LICS.2001.932486
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We provide a semantic framework for (first order) message-passing process calculi by combining categorical theories of abstract syntax with binding and operational semantics. In particular, we obtain abstract rule formats for name and value passing with both late and early interpretations. These formats induce an initial-algebra/final-coalgebra semantics that is compositional, respects substitution, and is fully abstract for late and early congruence. We exemplify the theory with the pi -calculus and value-passing CCS.
引用
收藏
页码：93 / 104
页数：12
相关论文
共 35 条
  • [1] ACZEL P, 1989, LECT NOTES COMPUT SC, V389, P357
  • [2] Aczel P, 1988, LECT NOTES, V14
  • [3] Adamek J., 1994, LOCALLY PRESENTABLE
  • [4] [Anonymous], 1978, CURRENT TRENDS PROGR
  • [5] PROCESS ALGEBRA FOR SYNCHRONOUS COMMUNICATION
    BERGSTRA, JA
    KLOP, JW
    [J]. INFORMATION AND CONTROL, 1984, 60 (1-3): : 109 - 137
  • [6] A congruence theorem for structured operational semantics of higher-order languages
    Bernstein, KL
    [J]. THIRTEENTH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 1998, : 153 - 164
  • [7] BISIMULATION CANT BE TRACED
    BLOOM, B
    ISTRAIL, SN
    MEYER, AR
    [J]. JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY, 1995, 42 (01): : 232 - 268
  • [8] Cattani GL, 2000, IEEE S LOG, P322
  • [9] CATTANI GL, 1997, LNCS, V1290, P106
  • [10] COHN R, 1965, UNIVERSAL ALGEBRA
1234