On the \(\pi\)-calculus and linear logic
From MaRDI portal
Publication:1342247
DOI10.1016/0304-3975(94)00104-9zbMath0817.03001OpenAlexW2010649834MaRDI QIDQ1342247
Gianluigi Bellin, Philip J. Scott
Publication date: 9 February 1995
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00104-9
Logic in computer science (03B70) Subsystems of classical logic (including intuitionistic logic) (03B20)
Related Items (30)
Multiparty session types as coherence proofs ⋮ Head linear reduction and pure proof net extraction ⋮ A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types ⋮ Conflation Confers Concurrency ⋮ Linear $$ \lambda \mu $$ is $$ \textsc {CP} $$ (more or less) ⋮ Strong normalisation in the \(\pi\)-calculus ⋮ A proof theoretical approach to communication ⋮ The true concurrency of differential interaction nets ⋮ Separating Sessions Smoothly ⋮ Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic ⋮ Protocol choice and iteration for the free cornering ⋮ Unnamed Item ⋮ Choreographies, logically ⋮ Unnamed Item ⋮ Focused linear logic and the \(\lambda\)-calculus ⋮ Variations on mobile processes ⋮ The logic of message-passing ⋮ Observed Communication Semantics for Classical Processes ⋮ Relating State-Based and Process-Based Concurrency through Linear Logic ⋮ Linear logic propositions as session types ⋮ An exact correspondence between a typed pi-calculus and polarised proof-nets ⋮ Coordination: Reo, Nets, and Logic ⋮ Relating state-based and process-based concurrency through linear logic (full-version) ⋮ Phase semantics and Petri net interpretation for resource-sensitive strong negation ⋮ Reaction graph ⋮ Constructing weak simulations from linear implications for processes with private names ⋮ Assertions, Hypotheses, Conjectures, Expectations: Rough-Sets Semantics and Proof Theory ⋮ What is a ``good encoding of guarded choice? ⋮ Propositions as sessions ⋮ Prioritise the best variation
Cites Work
- Linear logic
- Linear logic, coherence and dinaturality
- Computational interpretations of linear logic
- A game semantics for linear logic
- The structure of multiplicatives
- Planar and braided proof-nets for multiplicative linear logic with mix
- New foundations for the geometry of interaction
- Proofs as processes
- Games and full completeness for multiplicative linear logic
- Linear Logic as CSP
- Causal dependencies in multiplicative linear logic with MIX
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the \(\pi\)-calculus and linear logic
