MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Computer Science and Artificial Intelligence Lab (CSAIL)
  • LCS Publications
  • LCS Technical Memos (1974 - 2003)
  • View Item
  • DSpace@MIT Home
  • Computer Science and Artificial Intelligence Lab (CSAIL)
  • LCS Publications
  • LCS Technical Memos (1974 - 2003)
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Operational Semantics of a Data Flow Language

Author(s)
Brock, Jarvis D.
Thumbnail
DownloadMIT-LCS-TM-120.pdf (15.08Mb)
Advisor
Dennis, Jack B.
Metadata
Show full item record
Abstract
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.
Date issued
1978-12
URI
https://hdl.handle.net/1721.1/148948
Series/Report no.
MIT-LCS-TM-120

Collections
  • LCS Technical Memos (1974 - 2003)

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.