An adequate compositional encoding of bigraph structure in linear logic with subexponentials

DOI10.1007/978-3-662-48899-7_11MaRDI QIDQ3460050zbMATH OpenOpenAlexFDO

Authors Kaustuv Chaudhuri, Giselle Reis

Publication date 12 January 2016

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-01208362/file/lpar2015.pdf

Mathematics Subject Classification ID

Logic in computer science (03B70) 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

• Specifying proof systems in linear logic with subexponentials
• On subexponentials, focusing and modalities in concurrent systems
• Subexponential concurrent constraint programming
• Automata, Languages and Programming
• Expressing additives using multiplicatives and subexponentials

Cited in

(6)

• Hybrid and subexponential linear logics
• On concurrent behaviors and focusing in linear logic
• The ILLTP library for intuitionistic linear logic
• Hybrid linear logic, revisited
• A linear logic framework for multimodal logics
• A Survey of the Proof-Theoretic Foundations of Logic Programming

This page was built for publication: An adequate compositional encoding of bigraph structure in linear logic with subexponentials

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