Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Denotational semantics
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Denotational semantics of non-deterministic programs=== The concept of [[power domains]] has been developed to give a denotational semantics to non-deterministic sequential programs. Writing ''P'' for a power-domain constructor, the domain ''P''(''D'') is the domain of non-deterministic computations of type denoted by ''D''. There are difficulties with fairness and [[Unbounded nondeterminism|unboundedness]] in domain-theoretic models of non-determinism.<ref>{{cite journal |first=Paul Blain |last=Levy |title=Amb Breaks Well-Pointedness, Ground Amb Doesn't |journal=Electron. Notes Theor. Comput. Sci. |volume=173 |pages=221β239 |year=2007 |doi=10.1016/j.entcs.2007.02.036 |doi-access=free }}</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)