A fully abstract semantics for concurrent constraint programming

DOI10.1006/INCO.1998.2738MaRDI QIDQ1275748zbMATH OpenOpenAlexFDO

Authors Sven-Olof Nyström, Bengt Jonsson

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

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

Recommendations

• scientific article; zbMATH DE number 1638652
• scientific article; zbMATH DE number 1113818
• scientific article; zbMATH DE number 1088220
• 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
• scientific article; zbMATH DE number 1405453

Cites work

• scientific article; zbMATH DE number 1638652 (Why is no real title available?)
• 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?)
• A Theory of Communicating Sequential Processes
• A fully abstract trace model for dataflow and asynchronous networks
• Adjointness in Foundations
• Countable nondeterminism and random assignment
• 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

(8)

• scientific article; zbMATH DE number 1405453 (Why is no real title available?)
• scientific article; zbMATH DE number 1223724 (Why is no real title available?)
• scientific article; zbMATH DE number 1444329 (Why is no real title available?)
• scientific article; zbMATH DE number 1113818 (Why is no real title available?)
• Full abstraction for fair testing in CCS
• scientific article; zbMATH DE number 1479607 (Why is no real title available?)
• Observational and behavioural equivalences for soft concurrent constraint programming
• scientific article; zbMATH DE number 1638652 (Why is no real title available?)

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)