On subexponentials, focusing and modalities in concurrent systems
From MaRDI portal
Publication:2404074
DOI10.1016/j.tcs.2017.06.009zbMath1373.68298OpenAlexW2627861920WikidataQ57850691 ScholiaQ57850691MaRDI QIDQ2404074
Vivek Nigam, Elaine Pimentel, Carlos Olarte
Publication date: 12 September 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.06.009
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Related Items
A linear logic framework for multimodal logics, An Analytic Propositional Proof System on Graphs, A Survey of the Proof-Theoretic Foundations of Logic Programming, A fresh view of linear logic as a logical framework, Hybrid linear logic, revisited, Non-associative, non-commutative multi-modal linear logic, A focused linear logical framework and its application to metatheory of object logics, Connecting Sequent Calculi with Lorenzen-Style Dialogue Games
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamic spaces in concurrent constraint programming
- Proving concurrent constraint programming correct, revisited
- Linear logic
- Timed default concurrent constraint programming
- A framework for proof systems
- Subexponential concurrent constraint programming
- Focusing and polarization in linear, intuitionistic, and classical logics
- The Esterel synchronous programming language: Design, semantics, implementation
- Mobile ambients
- Truly concurrent constraint programming
- Hybrid and subexponential linear logics
- Linear concurrent constraint programming: Operational and phase semantics
- Models and emerging trends of concurrent constraint programming
- A framework for linear authorization logics
- A General Proof System for Modalities in Concurrent Constraint Programming
- Spatial and Epistemic Modalities in Constraint-Based Process Calculi
- A Proof Theoretic Study of Soft Concurrent Constraint Programming
- On the Complexity of Linear Authorization Logics
- Classical and Intuitionistic Subexponential Logics Are Equally Expressive
- From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
- Logic Programming with Focusing Proofs in Linear Logic
- A foundation for higher-order concurrent constraint programming
- Specifying Proof Systems in Linear Logic with Subexponentials
- Soft concurrent constraint programming
- A Linear Logic of Authorization and Knowledge