Jump to content

Angelic non-determinism: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
No edit summary
Added very early reference to the term and more modern one, can't find source that says Hoare coined it so removed that assertion.
Line 5: Line 5:
{{see also|Demonic non-determinism}}
{{see also|Demonic non-determinism}}


A term coined by [[Tony Hoare|C.A.R Hoare]], which describes the execution of a [[non-deterministic program]] where all choices that are made favor termination.
A term which describes the execution of a [[non-deterministic program]] where all choices that are made favor termination.


==References==
[[Category:Theoretical computer science]]
{{cite journal |last1=Wirsing |first1=M. |last2=Broy |first2=M. |title=On the algebraic specification of nondeterministic programming languages |journal=CAAP '81 |date=5 March 1981 |pages=162–179 |doi=10.1007/3-540-10828-9_61 |url=https://rd.springer.com/chapter/10.1007/3-540-10828-9_61 |publisher=Springer, Berlin, Heidelberg |language=en}}


{{cite journal |last1=Bodik |first1=Rastislav |last2=Chandra |first2=Satish |last3=Galenson |first3=Joel |last4=Kimelman |first4=Doug |last5=Tung |first5=Nicholas |last6=Barman |first6=Shaon |last7=Rodarmor |first7=Casey |title=Programming with Angelic Nondeterminism |journal=SIGPLAN Not. |date=2010 |volume=45 |issue=1 |pages=339–352 |doi=10.1145/1707801.1706339 |url=https://dl.acm.org/citation.cfm?id=1706339 |issn=0362-1340}}

[[Category:Theoretical computer science]]
{{comp-sci-theory-stub}}
{{comp-sci-theory-stub}}

Revision as of 02:59, 31 January 2019

A term which describes the execution of a non-deterministic program where all choices that are made favor termination.

References

Wirsing, M.; Broy, M. (5 March 1981). "On the algebraic specification of nondeterministic programming languages". CAAP '81. Springer, Berlin, Heidelberg: 162–179. doi:10.1007/3-540-10828-9_61.

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