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 条
  • [41] Better never than late
    Kurzwell, R
    FORBES, 1998, : 46 - +
  • [42] BETTER LATE THAN NEVER
    不详
    LANCET, 1948, 252 (DEC25): : 1018 - 1018
  • [43] Better late than never
    Webzell, Steed
    Machinery, 2003, 161 (4065): : 37 - 38
  • [44] BETTER LATE THAN NEVER
    HORGAN, J
    SCIENTIFIC AMERICAN, 1995, 272 (06) : 32 - 32
  • [45] BETTER NEVER THAN LATE
    CHILTON, S
    COLLEGE AND UNIVERSITY, 1965, 41 (01): : 77 - 79
  • [46] Better Late Than Never
    Ramaswamy, Anuradha
    Boonyapredee, Maytee
    Ranganath, Ramakrishnan
    Harte, Brian J.
    Pile, James C.
    JOURNAL OF HOSPITAL MEDICINE, 2011, 6 (06) : 364 - 368
  • [47] BETTER LATE THAN NEVER
    MCNAUGHTON, TGH
    DATAMATION, 1979, 25 (10): : 44 - &
  • [48] BETTER LATE THAN NEVER
    LYTLE, NK
    COMMUNICATIONS OF THE ACM, 1990, 33 (07) : 126 - 126
  • [49] Better late than never-but never late is best!
    Khader, Tarek
    Lieman, Harry J.
    Jindal, Sangita
    FERTILITY AND STERILITY, 2023, 119 (04) : 697 - 698
  • [50] Late bloomers (Better late than never)
    Driver, K
    DANCE MAGAZINE, 2005, 79 (05): : 12 - 12