Better late than never

被引:0
|
作者
Kokke W. [1 ]
Montesi F. [2 ]
Peressotti M. [2 ]
机构
[1] Laboratory for Foundations of Computer Science, University of Edinburgh, 10 Crichton Street, Edinburgh, Scotland
[2] Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, Odense
来源
基金
英国工程与自然科学研究理事会;
关键词
Behavioural Theory; Curry-Howard correspondence; Deadlock-freedom;
D O I
10.1145/3290337
中图分类号
学科分类号
摘要
We present Hypersequent Classical Processes (HCP), a revised interpretation of the łProofs as Processesž correspondence between linear logic and the π -calculus initially proposed by Abramsky [1994], and later developed by Bellin and Scott [1994], Caires and Pfenning [2010], and Wadler [2014], among others. HCP mends the discrepancies between linear logic and the syntax and observable semantics of parallel composition in the π - calculus, by conservatively extending linear logic to hyperenvironments (collections of environments, inspired by the hypersequents by Avron [1991]). Separation of environments in hyperenvironments is internalised by and corresponds to parallel process behaviour. Thanks to this property, for the first time we are able to extract a labelled transition system (lts) semantics from proof rewritings. Leveraging the information on parallelism at the level of types, we obtain a logical reconstruction of the delayed actions that Merro and Sangiorgi [2004] formulated to model non-blocking I/O in the π -calculus. We define a denotational semantics for processes based on Brzozowski derivatives, and uncover that non-interference in HCP corresponds to Fubini's theorem of double antiderivation. Having an lts allows us to validate HCP using the standard toolbox of behavioural theory. We instantiate bisimilarity and barbed congruence for HCP, and obtain a full abstraction result: bisimilarity, denotational equivalence, and barbed congruence coincide. © 2019 Copyright held by the owner/author(s).
引用
收藏
相关论文
共 50 条
  • [31] BETTER LATE THAN NEVER
    MILLAR, JR
    CHEMISTRY & INDUSTRY, 1965, (22) : 943 - &
  • [32] Better late than never
    Gawrylewski, Andrea
    SCIENTIST, 2008, 22 (12): : 21 - 22
  • [33] Better late than never?
    Williams, D
    CHEMISTRY & INDUSTRY, 1997, (01) : 8 - 8
  • [34] Better late than never
    Heath, R. V.
    AMERICAN MATHEMATICAL MONTHLY, 2007, 114 (08): : 745 - 746
  • [35] BETTER LATE THAN NEVER?
    Chen, Zhongbo
    Zhang, Wei-Jia
    Ramachandran, Radha
    Rahman, Yusof
    Nashef, Lina
    JOURNAL OF NEUROLOGY NEUROSURGERY AND PSYCHIATRY, 2014, 85 (10):
  • [36] BETTER LATE THAN NEVER
    CLARK, RJ
    NATIONAL WESTMINSTER BANK QUARTERLY REVIEW, 1972, (NOV): : 2 - 5
  • [37] Better late than never
    Marans, N
    CHEMICAL & ENGINEERING NEWS, 2003, 81 (49) : 6 - 6
  • [38] BETTER LATE THAN NEVER
    GRIBBIN, J
    NEW SCIENTIST, 1985, 107 (1467) : 49 - 49
  • [39] Better Late Than Never
    Gregory, Katie
    DANCING TIMES, 2008, 99 (1179): : 97 - 97
  • [40] Better late than never
    不详
    NATURE, 2007, 450 (7169) : 458 - 458