Operational Semantics of a Data Flow Language.

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 operational semantics O dot J of ADFL are expressed by a two step process. The translation algorithm J 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 communicating processes. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1978
Accession Number
ADA062997

Entities

People

  • Jarvis Dean Brock

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Assembly
  • Assembly Languages
  • Computations
  • Computer Languages
  • Computer Programming
  • Computer Science
  • Computers
  • Engineering
  • Instructions
  • Iterations
  • Language
  • Linguistics
  • Machine Languages
  • Programming Languages
  • Translations

Fields of Study

  • Computer science
  • Engineering

Readers

  • Computational Linguistics
  • Mathematical Modeling and Probability Theory.