DENOTATIONAL SEMANTICS OF DETERMINATE AND NONDETERMINATE
Paul R. Kosinski · 1979
Among its other characteristics, a programming language should be conducive to writing modular program''s, be able to express parallelism and non-determinate behavior, and it should have a cleanly formalizeable semantics. Data flow programming languages have all these characteristics and are especially amenable to mathematization of their semantics in the denotational style of Scott and Strachey. Many real world programming problems, such as operating systems and data base inquiry systems, require a programming language capable of non-determinacy because of the relation of this approach to other approaches. In particular, it is unnecessary to use the power domain construction in order to handle simple non-determinacy in data flow languages.