Denotational Semantics of Determinate and Non-Determinate Data Flow Programs

Abstract

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 formalizable 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.