Operational Semantics of a Data Flow Language
A data flow machine achieves high performance by the concurrent execution of machine code consisting of data flow graphs which explicitly represent the data dependencies among program instructions. This thesis presents the operational semantics of ADFL, an applicative data flow language with an iter...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
2023
|
| Online Access: | https://hdl.handle.net/1721.1/148948 |
| _version_ | 1826206283162714112 |
|---|---|
| author | Brock, Jarvis D. |
| author2 | Dennis, Jack B. |
| author_facet | Dennis, Jack B. Brock, Jarvis D. |
| author_sort | Brock, Jarvis D. |
| collection | MIT |
| description | A data flow machine achieves high performance by the concurrent execution of machine code consisting of data flow graphs which explicitly represent the data dependencies among program instructions. This thesis presents the operational semantics of ADFL, an applicative data flow language with an iteration construct resembling tail recursion and an error-handling scheme appropriate to the concurrency of data flow. The operation semantics O*T of ADFL are expressed by a two step process. The translation algorithm T maps an ADFL expression into its graph implementation, and the semantic function O maps the graph into its semantic characterization. Data flow graphs are specified by use of a graph assembly language, and the semantics of these graphs are derived by use of Kahn's fixpoint theory of communciating processes. |
| first_indexed | 2024-09-23T13:26:41Z |
| id | mit-1721.1/148948 |
| institution | Massachusetts Institute of Technology |
| last_indexed | 2024-09-23T13:26:41Z |
| publishDate | 2023 |
| record_format | dspace |
| spelling | mit-1721.1/1489482023-03-30T03:38:11Z Operational Semantics of a Data Flow Language Brock, Jarvis D. Dennis, Jack B. A data flow machine achieves high performance by the concurrent execution of machine code consisting of data flow graphs which explicitly represent the data dependencies among program instructions. This thesis presents the operational semantics of ADFL, an applicative data flow language with an iteration construct resembling tail recursion and an error-handling scheme appropriate to the concurrency of data flow. The operation semantics O*T of ADFL are expressed by a two step process. The translation algorithm T maps an ADFL expression into its graph implementation, and the semantic function O maps the graph into its semantic characterization. Data flow graphs are specified by use of a graph assembly language, and the semantics of these graphs are derived by use of Kahn's fixpoint theory of communciating processes. 2023-03-29T14:11:54Z 2023-03-29T14:11:54Z 1978-12 https://hdl.handle.net/1721.1/148948 4547287 MIT-LCS-TM-120 application/pdf |
| spellingShingle | Brock, Jarvis D. Operational Semantics of a Data Flow Language |
| title | Operational Semantics of a Data Flow Language |
| title_full | Operational Semantics of a Data Flow Language |
| title_fullStr | Operational Semantics of a Data Flow Language |
| title_full_unstemmed | Operational Semantics of a Data Flow Language |
| title_short | Operational Semantics of a Data Flow Language |
| title_sort | operational semantics of a data flow language |
| url | https://hdl.handle.net/1721.1/148948 |
| work_keys_str_mv | AT brockjarvisd operationalsemanticsofadataflowlanguage |