Research output per year
Research output per year
Wen Kokke, Fabrizio Montesi, Marco Peressotti
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Process calculi based on logic, such as πDILL and CP, provide a foundation for deadlock-free concurrent programming. However, in previous work, there is a mismatch between the rules for constructing proofs and the term constructors of the π-calculus: the fundamental operator for parallel composition does not correspond to any rule of linear logic. Kokke et al. [12] introduced Hypersequent Classical Processes (HCP), which addresses this mismatch using hypersequents (collections of sequents) to register parallelism in the typing judgements. However, the step from CP to HCP is a big one. As of yet, HCP does not have reduction semantics, and the addition of delayed actions means that CP processes interpreted as HCP processes do not behave as they would in CP. We introduce HCP − , a variant of HCP with reduction semantics and without delayed actions. We prove progress, preservation, and termination, and show that HCP − supports the same communication protocols as CP.
Original language | English |
---|---|
Title of host publication | Proceedings of the Joint International Workshop on Linearity Trends in linear Logic and Applications |
Editors | Thomas Ehrhard, Maribel Fernández, Valeria de Paiva, Lorenzo Tortora de Falco |
Volume | 292 |
Publisher | Open Publishing Association |
Publication date | 15. Apr 2019 |
Pages | 90-103 |
DOIs | |
Publication status | Published - 15. Apr 2019 |
Event | 2018 Joint International Workshop on Linearity and Trends in Linear Logic and Applications, Linearity-TLLA 2018 - Oxford, United Kingdom Duration: 7. Jul 2018 → 8. Jul 2018 |
Conference | 2018 Joint International Workshop on Linearity and Trends in Linear Logic and Applications, Linearity-TLLA 2018 |
---|---|
Country/Territory | United Kingdom |
City | Oxford |
Period | 07/07/2018 → 08/07/2018 |
Series | Electronic Proceedings in Theoretical Computer Science, EPTCS |
---|---|
Volume | 292 |
ISSN | 2075-2180 |
Research output: Contribution to journal › Journal article › Research › peer-review