Hoare and He’s unifying theories of programming (UTP) is a model of alphabetised relations expressed as predicates; it supports development in several programming paradigms. The aim of Hoare and He’s work is the unification of languages and techniques, so that we can benefit from results in different contexts. In this paper, we investigate the integration of angelic nondeterminism in the UTP; we propose the unification of a model of binary multirelations, which is isomorphic to the monotonic predicate transformers model and can express angelic and demonic nondeterminism.
Bibliographical noteAuthor can archive post-print (ie final draft post-refereeing). For full details see http://www.sherpa.ac.uk/romeo/ [Accessed 12/11/09]
Cavalcanti, A. A., Woodcock, J. C. P. J., & Dunne, S. E. S. (2006). Angelic nondeterminism in the unifying theories of programming. Formal Aspects of Computing, 18(3), 288-307. https://doi.org/10.1007/s00165-006-0001-8