Typed event structures and the linear π-calculus

被引:15
|
作者
Varacca, Daniele [1 ,2 ]
Yoshida, Nobuko [3 ]
机构
[1] Univ Paris Diderot, PPS, Paris, France
[2] CNRS, F-75700 Paris, France
[3] Univ London Imperial Coll Sci Technol & Med, London SW7 2AZ, England
基金
英国工程与自然科学研究理事会;
关键词
Event structures; Types; Linearity; Confusion freeness; pi-calculus; STRUCTURE SEMANTICS; PETRI NETS;
D O I
10.1016/j.tcs.2010.01.024
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We propose a typing system for the true concurrent model of event structures that guarantees the interesting behavioural properties known as conflict freeness and confusion freeness. Conflict freeness is the true concurrent version of the notion of confluence. A system is confusion free if nondeterministic choices are localised and do not depend on the scheduling of independent components. Ours is the first typing system to control behaviour in a true concurrent model. To demonstrate its applicability, we show that typed event structures give a semantics of linearly typed version of the pi-calculi with internal mobility. The semantics we provide is the first event structure semantics of the pi-calculus and generalises Winskel's original event structure semantics of CCS. (c) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码:1949 / 1973
页数:25
相关论文
共 50 条
  • [31] A quantitative model for simply typed λ-calculus
    Hofmann, Martin
    Ledent, Jeremy
    MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2022, 32 (06) : 777 - 793
  • [32] STRONG NORMALIZATION OF A TYPED LAMBDA CALCULUS FOR INTUITIONISTIC BOUNDED LINEAR-TIME TEMPORAL LOGIC
    Kamide, Norihiro
    REPORTS ON MATHEMATICAL LOGIC, 2012, 47 : 29 - 61
  • [33] FOCUSED PROOF SEARCH FOR LINEAR LOGIC IN THE CALCULUS OF STRUCTURES
    Guenot, Nicolas
    TECHNICAL COMMUNICATIONS OF THE 26TH INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING (ICLP'10), 2010, 7 : 84 - 93
  • [34] Normalization by evaluation for typed lambda calculus with coproducts
    Altenkirch, T
    Dybjer, P
    Hofmann, M
    Scott, P
    16TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2001, : 303 - 310
  • [35] Semantics of a Typed Algebraic Lambda-Calculus
    Valiron, Benoit
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2010, (26): : 147 - 158
  • [36] A Typed Slicing Compilation of the Polymorphic RPC calculus
    Choi, Kwanghoon
    Cheney, James
    Lindley, Sam
    Reynders, Bob
    PROCEEDINGS OF THE 23RD INTERNATIONAL SYMPOSIUM ON PRINCIPLES AND PRACTICE OF DECLARATIVE PROGRAMMING, PPDP 2021, 2021,
  • [37] TYPED LAMBDA-CALCULUS WITH RECURSIVE DEFINITIONS
    KOTOV, SV
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 620 : 246 - 257
  • [38] ASPfun: A typed functional active object calculus
    Henrio, Ludovic
    Kammueller, Florian
    Lutz, Bianca
    SCIENCE OF COMPUTER PROGRAMMING, 2012, 77 (7-8) : 823 - 847
  • [39] XPi: A typed process calculus for XML messaging
    Acciai, L
    Boreale, M
    FORMAL METHODS FOR OPEN OBJECT-BASED DISTRIBUTED SYSTEMS, PROCEEDINGS, 2005, 3535 : 47 - 66
  • [40] A Tutorial Implementation of a Dependently Typed Lambda Calculus
    Loh, Andres
    McBride, Conor
    Swierstra, Wouter
    FUNDAMENTA INFORMATICAE, 2010, 102 (02) : 177 - 207