Logic Programming with Bunched Implications (extended Abstract)
نویسنده
چکیده
We introduce the logic of bunched implications, BI, in which multiplicative (or linear) and additive (or intuitionistic) implications live side-by-side. We provide a truth conditional semantics, a proof theory and a categorical semantics of proofs. We explain how BI arises as a logic of resources and sketch a development of this computational interpretation, which is quite diierent from that of linear logic, in the setting of logic programming. Predicate BI, used in our account of logic programming , admits not only the usual (additive) quantiiers but also multiplicative (or intensional) quantiiers if the kind long sought in relevant logic.
منابع مشابه
Resource Graphs and Countermodels in Resource Logics
In this abstract we emphasize the role of a semantic structure called resource graph in order to study the provability in some resource-sensitive logics, like the Bunched Implications Logic (BI) or the Non-commutative Logic (NL). Such a semantic structure is appropriate for capturing the particular interactions between different kinds of connectives (additives and multiplicatives in BI, commuta...
متن کاملKripke resource models of a dependently - typed , bunched λ - calculus ( extended abstract )
The λΛ-calculus is a dependent type theory with both linear and intuitionistic dependent function spaces. It can be seen to arise in two ways. Firstly, in logical frameworks, where it is the language of the RLF logical framework and can uniformly represent linear and other relevant logics. Secondly, it is a presentation of the proof-objects of BI, the logic of bunched implications. BI is a logi...
متن کاملResource Tableaux ( extended abstract )
The logic of bunched implications, BI, provides a logical analysis of a basic notion of resource rich enough to provide a “pointer logic” semantics for programs which manipulate mutable data structures. We develop a theory of semantic tableaux for BI, so providing an elegant basis for efficient theorem proving tools for BI. It is based on the use of an algebra of labels for BI’s tableaux to sol...
متن کاملar X iv : 1 30 7 . 55 92 v 4 [ cs . L O ] 2 6 N ov 2 01 3 Proof Search for Propositional Abstract Separation Logics via Labelled Sequents
Abstract separation logics are a family of extensions of Hoare logic for reasoning about programs that mutate memory. These logics are “abstract” because they are independent of any particular concrete memory model. Their assertion languages, called propositional abstract separation logics, extend the logic of (Boolean) Bunched Implications (BBI) in various ways. We develop a modular proof theo...
متن کاملModel checking Demos using PBI: A Simple Approach
[Hay03] defines the non-temporal semantics of a simulation language, Demos, in order to be able to model processes acting on shared resources. It also defines the semantics of a logic, PBI, an extension of the Logic of Bunched Implications [POY02, Pym02, OP99], to query these models. This document describes a simple model checker capable of checking a subclass of PBI formulæ against Demos model...
متن کامل