Conflation Confers Concurrency
From MaRDI portal
Publication:3188279
DOI10.1007/978-3-319-30936-1_2zbMath1343.68159OpenAlexW2340622488MaRDI QIDQ3188279
Sam Lindley, J. Garrett Morris, Robert Atkey
Publication date: 17 August 2016
Published in: A List of Successes That Can Change the World (Search for Journal in Brave)
Full work available at URL: https://strathprints.strath.ac.uk/56452/
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Related Items (7)
Comparing type systems for deadlock freedom ⋮ Separating Sessions Smoothly ⋮ Unnamed Item ⋮ Observed Communication Semantics for Classical Processes ⋮ Linearity, Control Effects, and Behavioral Types ⋮ Unnamed Item ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- Strong normalisation in the \(\pi\)-calculus
- An exact correspondence between a typed pi-calculus and polarised proof-nets
- Interpreting a finitary pi-calculus in differential interaction nets
- Proofs as processes
- On the \(\pi\)-calculus and linear logic
- Finite products are biproducts in a compact closed category
- A Semantics for Propositions as Sessions
- Propositions as sessions
- Deadlock Analysis of Unbounded Process Networks
- Session Types as Intuitionistic Linear Propositions
- Differential Structure in Models of Multiplicative Biadditive Intuitionistic Linear Logic
- The true concurrency of differential interaction nets
- Deadlock and lock freedom in the linear π-calculus
- Functionality in Combinatory Logic
- The Mechanical Evaluation of Expressions
- A New Type System for Deadlock-Free Processes
This page was built for publication: Conflation Confers Concurrency