A new linear logic for deadlock-free session-typed processes

DOI10.1007/978-3-319-89366-2_5zbMath1491.68120OpenAlexW2797550608WikidataQ57599625 ScholiaQ57599625MaRDI QIDQ1652969

Ornela Dardha, Simon J. Gay

Publication date: 17 July 2018

Full work available at URL: http://eprints.gla.ac.uk/161671/1/161671.pdf

Mathematics Subject Classification ID

Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Cut-elimination and normal-form theorems (03F05) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (7)

Comparing type systems for deadlock freedom ⋮ Separating Sessions Smoothly ⋮ Session-based concurrency in Maude: executable semantics and type checking ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Probabilistic Analysis of Binary Sessions ⋮ Prioritise the best variation

This page was built for publication: A new linear logic for deadlock-free session-typed processes