Angelic non-determinism

In computer science, angelic non-determinism is the execution of a non-deterministic program where all choices that are made favor termination of the program.

See also: Demonic non-determinism

References

Wirsing, M.; Broy, M. (5 March 1981). "On the algebraic specification of nondeterministic programming languages". Caap '81. Lecture Notes in Computer Science. Springer, Berlin, Heidelberg. 112: 162–179. doi:10.1007/3-540-10828-9_61. ISBN 978-3-540-10828-3.

Bodik, Rastislav; Chandra, Satish; Galenson, Joel; Kimelman, Doug; Tung, Nicholas; Barman, Shaon; Rodarmor, Casey (2010). "Programming with Angelic Nondeterminism". SIGPLAN Notices. 45 (1): 339–352. doi:10.1145/1707801.1706339. ISSN 0362-1340.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.