Integrating parallel dataflow programming with the Ada tasking model
TRI-Ada '94 Proceedings of the conference on TRI-Ada '94
Declarative Ada: parallel dataflow programming in a familiar context
CSC '95 Proceedings of the 1995 ACM 23rd annual conference on Computer science
| Hi-index | 0.00 |
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.