Denotational Semantics of Determinate and Non-Determinate Data Flow Programs
Name
MIT-LCS-TR-220.pdf
Size
4.66 MB
Format
Adobe PDF
Checksum (MD5)
8c4ff2c213586e669fee85e178fe69b6
Author(s)
Kosinski, Paul Roman
Advisor(s)
Dennis, Jack B.
Date Issued
July 1979
Series/Report no.
MIT-LCS-TR-220
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.
Persistent DSpace Link
