Published April 24, 1993
| Version Submitted
Technical Report
Open
Parallel Programming with Declarative Ada
Creators
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
Additional details
Identifiers
- Eprint ID
- 26856
- Resolver ID
- CaltechCSTR:1993.cs-tr-93-03
Funding
- Air Force Office of Scientific Research (AFOSR)
- AFOSR-91-0070
Dates
- Created
-
2001-05-14Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field
Caltech Custom Metadata
- Caltech groups
- Computer Science Technical Reports
- Series Name
- Computer Science Technical Reports