Nondeterminism in Constructive Z
Fundamenta Informaticae
An Approach to Nondeterminism in Translation of CZ Set Theory into Martin-Löf 's Theory of Types
Electronic Notes in Theoretical Computer Science (ENTCS)
Nondeterminism in Constructive Z
Fundamenta Informaticae
Hi-index | 0.00 |
The article defines algebraic semantics of singular (call-time-choice) and plural (run-time-choice) nondeterministic parameter passing and presents a specification language in which operations with both kinds of parameters can be defined simultaneously. Sound and complete calculi for both semantics are introduced. We study the relations between the two semantics and point out that axioms for operations with plural arguments may be considered as axiom schemata for operations with singular arguments.