A fully abstract semantics for concurrent constraint programming (Q1275748): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/inco.1998.2738 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2028746905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantales, observational logic and process semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Countable nondeterminism and random assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process algebra for synchronous communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3945564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory of Communicating Sequential Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantic models for concurrent logic languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2736349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterminism and infinite computations in constraint programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3898534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully abstract trace model for dataflow and asynchronous networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4054644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4151149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjointness in Foundations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5601829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4312460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3906397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3959414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: HYPERDOCTRINES, NATURAL DEDUCTION AND THE BECK CONDITION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495851 / rank
 
Normal rank

Latest revision as of 18:04, 28 May 2024

scientific article
Language Label Description Also known as
English
A fully abstract semantics for concurrent constraint programming
scientific article

    Statements

    A fully abstract semantics for concurrent constraint programming (English)
    0 references
    0 references
    0 references
    23 March 1999
    0 references
    0 references
    fully abstract semantics
    0 references
    0 references