Output details
11 - Computer Science and Informatics
Imperial College London
CLASSICAL BI: ITS SEMANTICS AND PROOF THEORY
<11>
Classical BI is a new addition to the family of bunched logics which originates in O’Hearn and Pym’s logic of bunched implications BI. CBI differs from existing bunched logics in that its multiplicative connectives behave classically rather than intuitionistically (including a multiplicative version of classical negation).
Multiplicative connectives are at the heart of bunched logics, and this paper gives one answer to the long-standing question (since Pym's 2004 monograph) of what it means to negate a resource, showing a number of consistent models where multiplicative negation represents a form of internal duality. Extends paper at POPL'09 22%/160 submissions.