Introduction to higher order categorical logic
Introduction to higher order categorical logic
Theoretical Computer Science
Topology via logic
A logical analysis of modules in logic programming
Journal of Logic Programming
Deciding provability of linear logic formulas
Proceedings of the workshop on Advances in linear logic
Region-based memory management
Information and Computation
Elements of distributed algorithms: modeling and analysis with Petri nets
Elements of distributed algorithms: modeling and analysis with Petri nets
The functional approach to programming
The functional approach to programming
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Contributions to the Theory of Logic Programming
Journal of the ACM (JACM)
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
BI as an assertion language for mutable data structures
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communication and Concurrency
Logic for Problem Solving
Operating system principles
Separation Logic: A Logic for Shared Mutable Data Structures
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Completeness Results for Linear Logic on Petri Nets
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
A Spatial Logic for Querying Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Linear Lambda-Calculus and Categorial Models Revisited
CSL '92 Selected Papers from the Workshop on Computer Science Logic
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Journal of Functional Programming
Resource-distribution via Boolean constraints
ACM Transactions on Computational Logic (TOCL)
Separation and information hiding
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The semantics of BI and resource tableaux
Mathematical Structures in Computer Science
Frame rules from answer types for code pointers
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Linear and affine logics with temporal, spatial and epistemic operators
Theoretical Computer Science
Context logic as modal logic: completeness and parametric inexpressivity
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A coordination approach to mobile components
Theoretical Computer Science - Formal methods for components and objects
Local Reasoning about Data Update
Electronic Notes in Theoretical Computer Science (ENTCS)
Systems Modelling via Resources and Processes: Philosophy, Calculus, Semantics, and Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
BI-hyperdoctrines, higher-order separation logic, and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS) - Special Issue ESOP'05
Theoretical Computer Science
Tutorial on Separation Logic (Invited Tutorial)
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Classical BI: a logic for reasoning about dualising resources
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Mathematical Structures in Computer Science
Graphical models of separation logic
Information Processing Letters
Algebra and logic for resource-based systems modelling
Mathematical Structures in Computer Science
A Fresh Look at Separation Algebras and Share Accounting
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Bunching for Regions and Locations
Electronic Notes in Theoretical Computer Science (ENTCS)
An introduction to context logic
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Semantics for structured systems modelling and simulation
Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques
A Unified Display Proof Theory for Bunched Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Compositional Shape Analysis by Means of Bi-Abduction
Journal of the ACM (JACM)
BI hyperdoctrines and higher-order separation logic
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Refinement and separation contexts
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Studia Logica
Inconsistency-Tolerant Bunched Implications
International Journal of Approximate Reasoning
Reasoning about Resources and Information: A Linear Logic Approach
Fundamenta Informaticae
Hi-index | 0.00 |
The logic of bunched implications, BI, is a substructural system which freely combines an additive (intuitionistic) and a multiplicative (linear) implication via bunches (contexts with two combining operations, one which admits Weakening and Contraction and one which does not). BI may be seen to arise from two main perspectives. On the one hand, from proof-theoretic or categorical concerns and, on the other, from a possible-worlds semantics based on preordered (commutative) monoids. This semantics may be motivated from a basic model of the notion of resource. We explain BI's proof-theoretic, categorical and semantic origins. We discuss in detail the question of completeness, explaining the essential distinction between BI with and without ⊥ (the unit of V). We give an extensive discussion of BI as a semantically based logic of resources, giving concrete models based on Petri nets, ambients, computer memory, logic programming, and money.