No label defined (Q3678639)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3900125
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3900125 |
Statements
1985
0 references
Lucid
0 references
programming language
0 references
dataflow languages
0 references
parallel programming
0 references
Iswim
0 references
Luswim
0 references
Program transformation
0 references
Program verification
0 references
0.771970808506012
0 references
0.7453488707542419
0 references
0.7281296849250793
0 references
Lucid is a programming language born in 1974. The authors' intention was that Lucid make a new approach to programming, displacing the ordinary imperative languages and offering a language compatible with the technologies of the supercomputers. This language ought also to prove that more realistic applications could be programmed in the equational style. The approach to programming in such a way proved to be a new approach to computation itself - the dataflow approach. The dataflow approach to computation was developed by M. McIlroy, J. Dennis, G. Kahn, and others. While the fundamental concepts of the von Neumann computer architecture and imperative programming languages are those of ''command'' and ''storage location'', the dataflow is based on the principle of processing the data while it is in motion through a dataflow network. A dataflow network is a system of nodes and processing stations connected by a number of communication channels or arcs. The processing stations may have more than one input and/or output port, they will not be connected sequentially (the network may even have loops in it). Lucid is intended to be a clean, non-procedural language used in conjunction with a dataflow approach to programming: a Lucid program is basically just a textual form of a dataflow graph. Its statements are just equations. The variables in a clause really can be thought of as having values which change in time. The user-defined functions can be thought as continuously operating processes which transform data streams (these processes are called filters). Lucid's temporal operators allow to realize iteration and dataflow computation directly and in a natural way. Lucid can also be seen as an attempt to anticipate the evolution of dataflow languages from the conventional languages, through the single- assignment and LISP-like functional languages: it has most thoroughly rejected the old von Neumann form of computation and adopted the parallel model one, of dataflow, in its place. In the present book the accent falls on Lucid as a practical tool rather than as an object of formal study. The primary objective of the book was to prove that dataflow is a real alternative to sequential/imperative computing and that dataflow algorithms can be naturally and concisely expressed in Lucid. An excellent pLucid interpreter (or ''evaluator'') was written by A. Faustini. The present version is written in C and requires UNIX operating system. In a substantial appendix to the book is presented the pLucid user's manual. The book is organized in seven chapters. The introduction discusses the problem of traditional and parallel programming, explaining at large the option to dataflow computation model. Chapters II and III present Iswim and Luswim as functional languages representing successive stages to the Lucid. Chapter IV presents Lucid and Luswim with nested iteration. Chapter V introduces the programming methodology appropriate for Lucid by some example problems and their solutions in pLucid. The Lucid basic concepts of stream and filter are emphasized in order to stress the difference between the traditional approach to programming as control flow and Lucid methodology to programming as data flow. Chapter VI, Program transformation, presents the semantics of the dataflow approach, the naturalness of the functional description of program computations by equations. Program verification is much easier in a functional language. The program transformation rules are discussed. Chapter VII (Beyond Lucid) presents five interesting proposals to develop pLucid, seen as a member of a whole Lucid family of languages. The pLucid programmer's manual in the appendix of the book (A. A. Faustini, A. A. G. Yaghi, S. G. Mathews) presents, in detail, the characteristics of the language, from the theoretical constructions to concrete programming examples. The book is a valuable contribution to the implementation of the parallel models of computation, namely dataflow. Spreading new ideas about the new programming techniques, methodology and languages of the next computer generations, the authors address, practically, the whole family of the computer related people.
0 references