A games model of bunched implications

0Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A game semantics of the (→*,→)-fragment of the logic of bunched implications, BI, is presented. To date, categorical models of BI have been restricted to two kinds: functor category models; and the category Cat itself. The game model is not of this kind. Rather, it is based on Hyland-Ong-Nickau-style games and embodies a careful analysis of the notions of resource sharing and separation inherent in BI. The key to distinguishing between the additive and multiplicative connectives of BI is a semantic notion of separation. The main result of the paper is that the model is fully complete: every finite, total strategy in the model is the denotation of a term of the αλ-calculus, the term language for the fragment of BI under consideration. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

McCusker, G., & Pym, D. (2007). A games model of bunched implications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4646 LNCS, pp. 573–588). Springer Verlag. https://doi.org/10.1007/978-3-540-74915-8_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free