Hybrid and subexponential linear logics
From MaRDI portal
Publication:1744445
DOI10.1016/j.entcs.2017.04.007zbMath1395.03034arXiv1608.08779OpenAlexW2664426418WikidataQ57850667 ScholiaQ57850667MaRDI QIDQ1744445
Elaine Pimentel, Joëlle Despeyroux, Carlos Olarte
Publication date: 23 April 2018
Full work available at URL: https://arxiv.org/abs/1608.08779
Logic in computer science (03B70) Temporal logic (03B44) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Related Items
On subexponentials, focusing and modalities in concurrent systems, A Survey of the Proof-Theoretic Foundations of Logic Programming, Unnamed Item, Hybrid linear logic, revisited, Mechanizing focused linear logic in Coq
Cites Work
- Linear logic
- Subexponential concurrent constraint programming
- Symbolic model checking: \(10^{20}\) states and beyond
- A linear logical framework
- A formal framework for specifying sequent calculus proof systems
- A proof theoretic view of spatial and temporal dependencies in biochemical systems
- A General Proof System for Modalities in Concurrent Constraint Programming
- Hybridizing a Logical Framework
- A Proof Theoretic Study of Soft Concurrent Constraint Programming
- Foundations for Reliable and Flexible Interactive Multimedia Scores
- An Adequate Compositional Encoding of Bigraph Structure in Linear Logic with Subexponentials
- Classical and Intuitionistic Subexponential Logics Are Equally Expressive
- Logic Programming with Focusing Proofs in Linear Logic
- Specifying Proof Systems in Linear Logic with Subexponentials
- A Logical Framework for Systems Biology
- Least and Greatest Fixed Points in Linear Logic
- Unnamed Item
- Unnamed Item
