Dual unbounded nondeterminacy, recursion, and fixpoints

Authors:
Joseph M. Morris;Malcolm Tyrrell
Affiliations:
Dublin City University, School of Computing, Dublin 9, Ireland and The Irish Software Engineering Research Centre, Lero, Limerick, Ireland;Dublin City University, School of Computing, Dublin 9, Ireland and The Irish Software Engineering Research Centre, Lero, Limerick, Ireland
Venue:
Acta Informatica
Year:
2007

Citing 0
Cited 4

Dually nondeterministic functions

ACM Transactions on Programming Languages and Systems (TOPLAS)
Term transformers: A new approach to state

ACM Transactions on Programming Languages and Systems (TOPLAS)
Alternating states for dual nondeterminism in imperative programming

Theoretical Computer Science
Plug-and-Play nondeterminacy

B'07 Proceedings of the 7th international conference on Formal Specification and Development in B

Quantified Score

Hi-index	0.00

Visualization

Abstract

In languages with unbounded demonic and angelic nondeterminacy, functions acquire a surprisingly rich set of fixpoints. We show how to construct these fixpoints, and describe which ones are suitable for giving a meaning to recursively defined functions. We present algebraic laws for reasoning about them at the language level, and construct a model to show that the laws are sound. The model employs a new kind of power domain-like construct for accommodating arbitrary nondeterminacy.