Thornley, John (1995) Declarative Ada: parallel dataflow programming in a familiar context. In: CSC '95 Proceedings of the 1995 ACM 23rd annual conference on Computer science. ACM , New York, NY, pp. 73-80. ISBN 0-89791-737-5. https://resolver.caltech.edu/CaltechAUTHORS:20161222-112057011
Full text is not posted in this repository. Consult Related URLs below.
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20161222-112057011
Abstract
Declarative parallel programming languages express and control parallelism at a high level of abstraction--through implicit dataflow, rather than explicit communication and synchronization operations. However, most declarative languages are esoteric, mathematically inspired notations with syntax, control constructs, and data types very different from popular sequential imperative languages. We present Declarative Ada, a parallel dataflow programming language with the same syntax as a simple Pascal-like subset of Ada. The difference between Declarative Ada and a sequential language is that all variables are single-assignment and all loops and compositions of statements are parallel by default. Declarative Ada programs implicitly express parallelism at all levels of granularity, yet can be constructed to be identical to equivalent sequential programs. We believe that Declarative Ada is an ideal language for learning a high-level, dataflow approach to parallel program design. A user-friendly, portable Declarative Ada compiler has been developed specifically for experimental and instructional use.
| Item Type: | Book Section | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Related URLs: |
| |||||||||
| Additional Information: | © 1995 ACM. This work was supported in part by Air Force Office of Scientific Research grant AFOSR-91-0070. | |||||||||
| Funders: |
| |||||||||
| DOI: | 10.1145/259526.259540 | |||||||||
| Record Number: | CaltechAUTHORS:20161222-112057011 | |||||||||
| Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:20161222-112057011 | |||||||||
| Official Citation: | John Thornley. 1995. Declarative Ada: parallel dataflow programming in a familiar context. In Proceedings of the 1995 ACM 23rd annual conference on Computer science (CSC '95), C. Jinshong Hwang and Betty W. Hwang (Eds.). ACM, New York, NY, USA, 73-80. DOI=http://dx.doi.org/10.1145/259526.259540 | |||||||||
| Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | |||||||||
| ID Code: | 73151 | |||||||||
| Collection: | CaltechAUTHORS | |||||||||
| Deposited By: | INVALID USER | |||||||||
| Deposited On: | 22 Dec 2016 19:33 | |||||||||
| Last Modified: | 11 Nov 2021 05:12 |
Repository Staff Only: item control page
