Subexponential concurrent constraint programming
DOI10.1016/J.TCS.2015.06.031zbMATH Open1332.68027DBLPjournals/tcs/OlartePN15OpenAlexW614375011WikidataQ57850748 ScholiaQ57850748MaRDI QIDQ897936FDOQ897936
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
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
Proof-theoretic aspects of linear logic and other substructural logics (03F52) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)
Cites Work
- Design, implementation, and evaluation of the constraint language cc(FD)
- Handbook of constraint programming.
- Truly concurrent constraint programming
- Title not available (Why is that?)
- Linear logic
- A calculus of mobile processes. I
- 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
- Dynamic spaces in concurrent constraint programming
- A General Proof System for Modalities in Concurrent Constraint Programming
- Spatial and Epistemic Modalities in Constraint-Based Process Calculi
- Observational equivalences for linear logic concurrent constraint languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Specifying Proof Systems in Linear Logic with Subexponentials
- Closures and Modules Within Linear Logic Concurrent Constraint Programming
- Timed default concurrent constraint programming
- Logic Programming with Focusing Proofs in Linear Logic
- Semiring-based constraint satisfaction and optimization
- Soft concurrent constraint programming
- From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
- A framework for proof systems
- A logic of soft constraints based on partially ordered preferences
- A Proof Theoretic Study of Soft Concurrent Constraint Programming
- Types for Secure Pattern Matching with Local Knowledge in Universal Concurrent Constraint Programming
- A Core Quantitative Coeffect Calculus
Cited In (13)
- Subexponentials in non-commutative linear logic
- On subexponentials, focusing and modalities in concurrent systems
- Hybrid and subexponential linear logics
- Hybrid linear logic, revisited
- On concurrent behaviors and focusing in linear logic
- A proof theoretic view of spatial and temporal dependencies in biochemical systems
- Universal proof theory: semi-analytic rules and Craig interpolation
- Mechanizing focused linear logic in Coq
- Slicing concurrent constraint programs
- A subexponential view of domains in session types
- Observational equivalences for linear logic concurrent constraint languages
- Kleene star, subexponentials without contraction, and infinite computations
- A Survey of the Proof-Theoretic Foundations of Logic Programming
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)
