Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published May 14, 2001 | Submitted
Report Open

Parallel Programming with Declarative Ada

Thornley, John

Abstract

Declarative programming languages (e.g., functional and logic programming languages) are semantically elegant and implicitly express parallelism at a high level. We show how a parallel declarative language can be based on a modern structured imperative language with single-assignment variables. Such a language combines the advantages of parallel declarative programming with the strengths and familiarity of the underlying imperative language. We introduce Declarative Ada, a parallel declarative language based on a subset of Ada. Declarative Ada integrates parallel and sequential composition, allowing sequential input and output from within parallel declarative programs.

Additional Information

© 1993 California Institute of Technology. Abril 24, 1993. Thank you to my advisor, Mani Chandy, for his guidance and support throughout all phases of this research. Also thank you to the other members of the compositional systems research group at Caltech, Adam Rifkin, Berna Massingill, Carl Kesselman, Paul Sivilotti, and Ulla Binau, for their suggestions and proofreading. Many of the ideas in Declarative Ada are derived from ideas in PCN. This research was supported in part by Air Force Office of Scientific Research grant AFSOR-91-0070.

Attached Files

Submitted - 93-03.pdf

Submitted - 93-03.ps

Files

93-03.pdf
Files (1.7 MB)
Name Size Download all
md5:22d4c14b1e52f629925d7a9b49adaf29
1.3 MB Preview Download
md5:0d0c2a1a43f66e461d69838efb71f51e
360.3 kB Download

Additional details

Created:
August 20, 2023
Modified:
January 13, 2024