There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations

DOI10.1016/S0020-0190(96)00177-9zbMath1336.68025OpenAlexW1987915730MaRDI QIDQ286953

Sven-Olof Nyström

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(96)00177-9

zbMATH Keywords

formal semanticsdenotational semanticsconcurrencyfixpoint semanticsfully abstract semanticsinfinite computationsnon-determinism

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)

Related Items (3)

A fixpoint theory for non-monotonic parallelism ⋮ A Fully Abstract Semantics for Constructor Systems ⋮ A fully abstract semantics for concurrent constraint programming

Cites Work

• Unnamed Item
• Unnamed Item
• The fixed point theory of unbounded non-determinism
• Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages
• Countable nondeterminism and random assignment
• Unbounded Non-determinism in CSP

This page was built for publication: There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations