Subexponential concurrent constraint programming
From MaRDI portal
Publication:897936
DOI10.1016/j.tcs.2015.06.031zbMath1332.68027OpenAlexW614375011WikidataQ57850748 ScholiaQ57850748MaRDI QIDQ897936
Vivek Nigam, Carlos Olarte, Elaine Pimentel
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
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Related Items
On concurrent behaviors and focusing in linear logic, A proof theoretic view of spatial and temporal dependencies in biochemical systems, On subexponentials, focusing and modalities in concurrent systems, Slicing concurrent constraint programs, A Survey of the Proof-Theoretic Foundations of Logic Programming, Kleene star, subexponentials without contraction, and infinite computations, Hybrid and subexponential linear logics, Hybrid linear logic, revisited, Subexponentials in non-commutative linear logic, Mechanizing focused linear logic in Coq
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamic spaces in concurrent constraint programming
- Linear logic
- Timed default concurrent constraint programming
- A framework for proof systems
- A calculus of mobile processes. I
- Truly concurrent constraint programming
- Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
- Linear concurrent constraint programming: Operational and phase semantics
- Models and emerging trends of concurrent constraint programming
- A logic of soft constraints based on partially ordered preferences
- 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
- Observational equivalences for linear logic concurrent constraint languages
- From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
- Logic Programming with Focusing Proofs in Linear Logic
- Design, implementation, and evaluation of the constraint language cc(FD)
- Semiring-based constraint satisfaction and optimization
- Specifying Proof Systems in Linear Logic with Subexponentials
- Soft concurrent constraint programming
- Types for Secure Pattern Matching with Local Knowledge in Universal Concurrent Constraint Programming
- A Core Quantitative Coeffect Calculus
- Closures and Modules Within Linear Logic Concurrent Constraint Programming
