Pages that link to "Item:Q5096300"
From MaRDI portal
The following pages link to A foundation for higher-order concurrent constraint programming (Q5096300):
Displaying 21 items.
- Dynamic spaces in concurrent constraint programming (Q281160) (← links)
- Proving concurrent constraint programming correct, revisited (Q530860) (← links)
- \(\gamma\) \(\omega\)-calculus semantics of functional programming language FFP (Q749201) (← links)
- A closer look at constraints as processes (Q844200) (← links)
- Subexponential concurrent constraint programming (Q897936) (← links)
- A fully abstract semantics for concurrent constraint programming (Q1275748) (← links)
- GOFFIN: Higher-order functions meet concurrent constraints (Q1380128) (← links)
- Decoding choice encodings (Q1854385) (← links)
- Integrating constraints and concurrent objects in musical applications: A calculus and its visual language (Q1859919) (← links)
- Models and emerging trends of concurrent constraint programming (Q2348541) (← links)
- On concurrent behaviors and focusing in linear logic (Q2358701) (← links)
- On subexponentials, focusing and modalities in concurrent systems (Q2404074) (← links)
- Slicing concurrent constraint programs (Q2409727) (← links)
- Operational semantics for declarative multi-paradigm languages (Q2456574) (← links)
- On the Implementation of Speculative Constraint Processing (Q3055681) (← links)
- (Q4219040) (← links)
- (Q4938428) (← links)
- Demand transformation analysis for concurrent constraint programs (Q4943435) (← links)
- A confluent relational calculus for higher-order programming with constraints (Q5096302) (← links)
- A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains (Q5179011) (← links)
- Constraints as processes (Q6104383) (← links)
