A fully abstract semantics for concurrent constraint programming

DOI10.1006/inco.1998.2738zbMath0913.68134OpenAlexW2028746905MaRDI QIDQ1275748

Bengt Jonsson, Sven-Olof Nyström

Publication date: 23 March 1999

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1998.2738

zbMATH Keywords

fully abstract semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Theory of software (68N99)

Related Items

Observational and behavioural equivalences for soft concurrent constraint programming

Cites Work

• There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations
• Nondeterminism and infinite computations in constraint programming
• Semantic models for concurrent logic languages
• A fully abstract trace model for dataflow and asynchronous networks
• HYPERDOCTRINES, NATURAL DEDUCTION AND THE BECK CONDITION
• Process algebra for synchronous communication
• Countable nondeterminism and random assignment
• A Theory of Communicating Sequential Processes
• Adjointness in Foundations
• Quantales, observational logic and process semantics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item