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

DOI10.1016/S0020-0190(96)00177-9MaRDI QIDQ286953zbMATH OpenOpenAlexFDO

Authors 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

concurrencydenotational semanticsfixpoint semanticsformal semanticsfully abstract semanticsinfinite computationsnon-determinism

Mathematics Subject Classification ID

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

Recommendations

• A simple fixpoint argument without the restriction to continuity
• scientific article; zbMATH DE number 194122
• scientific article; zbMATH DE number 512793
• A fully abstract semantics for a higher-order functional language with nondeterministic computation
• scientific article; zbMATH DE number 1231463

Cites work

• scientific article; zbMATH DE number 3763271 (Why is no real title available?)
• scientific article; zbMATH DE number 3469994 (Why is no real title available?)
• Countable nondeterminism and random assignment
• The fixed point theory of unbounded non-determinism
• Theory of -languages. I: Characterizations of -context- free languages
• Unbounded Non-determinism in CSP

Cited in

(4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286953)