On subexponentials, focusing and modalities in concurrent systems

DOI10.1016/J.TCS.2017.06.009MaRDI QIDQ2404074zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Vivek Nigam, Carlos Olarte, Elaine Pimentel

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

zbMATH Keywords

concurrent constraint programminglinear logicproof systems

Mathematics Subject Classification ID

Proof-theoretic aspects of linear logic and other substructural logics (03F52) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A general proof system for modalities in concurrent constraint programming
• Subexponential concurrent constraint programming
• Specifying proof systems in linear logic with subexponentials
• On concurrent behaviors and focusing in linear logic
• A proof theoretic study of soft concurrent constraint programming

Cites work

• A foundation for higher-order concurrent constraint programming
• A framework for linear authorization logics
• A framework for proof systems
• A general proof system for modalities in concurrent constraint programming
• A hybrid linear logic for constrained transition systems
• A linear logic of authorization and knowledge
• A proof theoretic study of soft concurrent constraint programming
• Classical and intuitionistic subexponential logics are equally expressive
• Dynamic spaces in concurrent constraint programming
• Focusing and polarization in linear, intuitionistic, and classical logics
• From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
• scientific article; zbMATH DE number 1809625 (Why is no real title available?)
• scientific article; zbMATH DE number 3780545 (Why is no real title available?)
• scientific article; zbMATH DE number 517072 (Why is no real title available?)
• scientific article; zbMATH DE number 1489627 (Why is no real title available?)
• scientific article; zbMATH DE number 3333259 (Why is no real title available?)
• Hybrid and subexponential linear logics
• Linear concurrent constraint programming: Operational and phase semantics
• Linear logic
• Logic Programming with Focusing Proofs in Linear Logic
• Mobile ambients
• Models and emerging trends of concurrent constraint programming
• On the complexity of linear authorization logics
• Proving concurrent constraint programming correct, revisited
• Soft concurrent constraint programming
• Spatial and epistemic modalities in constraint-based process calculi
• Specifying proof systems in linear logic with subexponentials
• Subexponential concurrent constraint programming
• The Esterel synchronous programming language: Design, semantics, implementation
• Timed default concurrent constraint programming
• Truly concurrent constraint programming

Cited in

(12)

• Hybrid and subexponential linear logics
• Non-associative, non-commutative multi-modal linear logic
• A fresh view of linear logic as a logical framework
• A general proof system for modalities in concurrent constraint programming
• An adequate compositional encoding of bigraph structure in linear logic with subexponentials
• A focused linear logical framework and its application to metatheory of object logics
• Connecting sequent calculi with Lorenzen-style dialogue games
• An Analytic Propositional Proof System on Graphs
• Hybrid linear logic, revisited
• A linear logic framework for multimodal logics
• A Survey of the Proof-Theoretic Foundations of Logic Programming
• A subexponential view of domains in session types

Describes a project that uses

Uses Software

• Esterel

This page was built for publication: On subexponentials, focusing and modalities in concurrent systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2404074)