Classical BI
From MaRDI portal
Publication:5261530
DOI10.1145/1480881.1480923zbMath1315.68175OpenAlexW2118698129MaRDI QIDQ5261530
Cristiano Calcagno, James Brotherston
Publication date: 3 July 2015
Published in: Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1480881.1480923
Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Cut-elimination and normal-form theorems (03F05)
Related Items
A Unified Display Proof Theory for Bunched Logic ⋮ An Alternative Direct Simulation of Minsky Machines into Classical Bunched Logics via Group Semantics ⋮ Bunched logics displayed ⋮ The virtues of idleness: a decidable fragment of resource agent logic ⋮ On Model Checking Boolean BI