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

DOI10.1016/S0020-0190(96)00177-9zbMATH Open1336.68025OpenAlexW1987915730MaRDI QIDQ286953FDOQ286953

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

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

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)

Cites Work

• Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages
• Countable nondeterminism and random assignment
• Title not available (Why is that?)
• Title not available (Why is that?)
• Unbounded Non-determinism in CSP
• The fixed point theory of unbounded non-determinism

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)