Subexponential concurrent constraint programming

DOI10.1016/J.TCS.2015.06.031MaRDI QIDQ897936zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Carlos Olarte, Elaine Pimentel, Vivek Nigam

Publication date 8 December 2015

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2015.06.031

zbMATH Keywords

linear logicconcurrent constraint programmingproof systems

Mathematics Subject Classification ID

Proof-theoretic aspects of linear logic and other substructural logics (03F52) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• scientific article; zbMATH DE number 1059301
• Truly concurrent constraint programming
• Truly concurrent constraint programming
• Concurrent and reactive constraint programming
• A confluent calculus for concurrent constraint programming
• scientific article; zbMATH DE number 1337862
• Soft concurrent constraint programming
• scientific article; zbMATH DE number 2087537
• scientific article; zbMATH DE number 1088220
• A foundation for higher-order concurrent constraint programming

Cites work

• scientific article; zbMATH DE number 1809625 (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?)
• A calculus of mobile processes. I
• A core quantitative coeffect calculus
• A framework for proof systems
• A general proof system for modalities in concurrent constraint programming
• A logic of soft constraints based on partially ordered preferences
• A proof theoretic study of soft concurrent constraint programming
• Closures and Modules Within Linear Logic Concurrent Constraint Programming
• Design, implementation, and evaluation of the constraint language cc(FD)
• Dynamic spaces in concurrent constraint programming
• From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
• Handbook of constraint programming.
• Linear concurrent constraint programming: Operational and phase semantics
• Linear logic
• Logic Programming with Focusing Proofs in Linear Logic
• Models and emerging trends of concurrent constraint programming
• Observational equivalences for linear logic concurrent constraint languages
• Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
• Semiring-based constraint satisfaction and optimization
• Soft concurrent constraint programming
• Spatial and epistemic modalities in constraint-based process calculi
• Specifying proof systems in linear logic with subexponentials
• Timed default concurrent constraint programming
• Truly concurrent constraint programming
• Types for Secure Pattern Matching with Local Knowledge in Universal Concurrent Constraint Programming

Cited in

(16)

• Dynamic spaces in concurrent constraint programming
• Subexponentials in non-commutative linear logic
• Universal proof theory: semi-analytic rules and Craig interpolation
• On subexponentials, focusing and modalities in concurrent systems
• A general proof system for modalities in concurrent constraint programming
• Kleene star, subexponentials without contraction, and infinite computations
• An adequate compositional encoding of bigraph structure in linear logic with subexponentials
• A proof theoretic study of soft concurrent constraint programming
• A proof theoretic view of spatial and temporal dependencies in biochemical systems
• A Survey of the Proof-Theoretic Foundations of Logic Programming
• On concurrent behaviors and focusing in linear logic
• Observational equivalences for linear logic concurrent constraint languages
• Hybrid and subexponential linear logics
• Mechanizing focused linear logic in Coq
• Hybrid linear logic, revisited
• A subexponential view of domains in session types

This page was built for publication: Subexponential concurrent constraint programming

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