Document Type

Article

Department

Computer Science (HMC)

Publication Date

2-1982

Abstract

Data flow languages form a subclass of the languages which are based primarily upon function application (i.e., applicative languages). By data flow language we mean any applicative language based entirely upon the notion of data flowing from one function entity to another or any language that directly supports such flowing. This flow concept gives data flow languages the advantage of allowing program definitions to be represented exclusively by graphs. Graphical representations and their applications are the subject of this article.

Comments

Reprinted in S.S. Thakkar (ed.), Dataflow and Reduction Architectures, 189-204, IEEE (1987).

Previously linked to as: http://ccdl.libraries.claremont.edu/u?/irw,342.

Source: Publisher's pdf.

The article can also be found at http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=34666&arnumber=1653939&count=23&index=4

Rights Information

© 1982 Institute of Electrical and Electronics Engineers (IEEE). Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Terms of Use & License Information

Terms of Use for work posted in Scholarship@Claremont.

Download

Share

COinS