Better Late Than Never: A Fully Abstract Semantics for Classical Processes
Wen Kokke, Fabrizio Montesi, Marco Peressotti

TL;DR
This paper introduces Hypersequent Classical Processes (HCP), a fully abstract semantics for classical processes that unifies proof theory and process calculus, enabling precise behavioral equivalence and modeling of parallelism.
Contribution
HCP extends linear logic with hyperenvironments to accurately model parallel composition and derives a labelled transition system from proof rewritings.
Findings
HCP provides a labelled transition system semantics for processes.
Bisimilarity, denotational equivalence, and barbed congruence coincide in HCP.
HCP models non-blocking I/O and parallelism effectively.
Abstract
We present Hypersequent Classical Processes (HCP), a revised interpretation of the "Proofs as Processes" correspondence between linear logic and the {\pi}-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 {\pi}-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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Logic, Reasoning, and Knowledge · Formal Methods in Verification
