A fully abstract semantics for concurrent constraint programming
From MaRDI portal
Recommendations
- A fully abstract model for concurrent constraint programming
- Logical semantics of concurrent constraint programming
- A foundation for higher-order concurrent constraint programming
- A foundation for higher-order concurrent constraint programming
- scientific article; zbMATH DE number 1332633
- A confluent calculus for concurrent constraint programming
- scientific article; zbMATH DE number 794260
- Truly concurrent constraint programming
- Truly concurrent constraint programming
- Abstracting properties in concurrent constraint programming
Cites work
- A fully abstract model for concurrent constraint programming
- A fully abstract trace model for dataflow and asynchronous networks
- A Theory of Communicating Sequential Processes
- Adjointness in Foundations
- Countable nondeterminism and random assignment
- scientific article; zbMATH DE number 995891 (Why is no real title available?)
- scientific article; zbMATH DE number 3706504 (Why is no real title available?)
- scientific article; zbMATH DE number 3714908 (Why is no real title available?)
- scientific article; zbMATH DE number 3763271 (Why is no real title available?)
- scientific article; zbMATH DE number 3780545 (Why is no real title available?)
- scientific article; zbMATH DE number 3469994 (Why is no real title available?)
- scientific article; zbMATH DE number 3581600 (Why is no real title available?)
- scientific article; zbMATH DE number 683344 (Why is no real title available?)
- scientific article; zbMATH DE number 1489627 (Why is no real title available?)
- scientific article; zbMATH DE number 794260 (Why is no real title available?)
- scientific article; zbMATH DE number 3322506 (Why is no real title available?)
- HYPERDOCTRINES, NATURAL DEDUCTION AND THE BECK CONDITION
- Nondeterminism and infinite computations in constraint programming
- Process algebra for synchronous communication
- Quantales, observational logic and process semantics
- Semantic models for concurrent logic languages
- There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations
Cited in
(10)- Observational and behavioural equivalences for soft concurrent constraint programming
- A fully abstract model for concurrent constraint programming
- Full abstraction for fair testing in CCS
- Concurrent constraints in the fusion calculus. (Extended abstract)
- scientific article; zbMATH DE number 1231566 (Why is no real title available?)
- scientific article; zbMATH DE number 1231586 (Why is no real title available?)
- Logical semantics of concurrent constraint programming
- Fully abstract semantics for concurrent -calculus
- Abstracting properties in concurrent constraint programming
- A Banach space based semantics for probabilistic concurrent constraint programming
This page was built for publication: A fully abstract semantics for concurrent constraint programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1275748)