Author:
O'Hearn Peter W.,Pym David J.
Abstract
AbstractWe introduce a logic BI in which a multiplicative (or linear) and an additive (or intuitionistic) implication live side-by-side. The propositional version of BI arises from an analysis of the proof-theoretic relationship between conjunction and implication; it can be viewed as a merging of intuitionistic logic and multiplicative intuitionistic linear logic. The naturality of BI can be seen categorically: models of propositional BI's proofs are given by bicartesian doubly closed categories, i.e., categories which freely combine the semantics of propositional intuitionistic logic and propositional multiplicative intuitionistic linear logic. The predicate version of BI includes, in addition to standard additive quantifiers, multiplicative (or intensional) quantifiers and which arise from observing restrictions on structural rules on the level of terms as well as propositions. We discuss computational interpretations, based on sharing, at both the propositional and predicate levels.
Publisher
Cambridge University Press (CUP)
Cited by
285 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Unification for Subformula Linking under Quantifiers;Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs;2024-01-09
2. Defining Logical Systems via Algebraic Constraints on Proofs;Journal of Logic and Computation;2023-11-24
3. Combining Dependency, Grades, and Adjoint Logic;Proceedings of the 8th ACM SIGPLAN International Workshop on Type-Driven Development;2023-08-30
4. Survey of the Formal Verification of Operating Systems in Power Monitoring System;Proceedings of the 2023 5th International Conference on Pattern Recognition and Intelligent Systems;2023-07-28
5. Beyond Backtracking: Connections in Fine-Grained Concurrent Separation Logic;Proceedings of the ACM on Programming Languages;2023-06-06