| Compiling APL for parallel and vector execution |
| Full text |
Pdf
(664 KB)
|
| Source
|
International Conference on APL
archive
Proceedings of the international conference on APL '91
table of contents
Palo Alto, California, United States
Pages: 80 - 87
Year of Publication: 1991
ISBN:0-89791-441-4
Also published in ...
|
|
Authors
|
|
Timothy A. Budd
|
Department of Computer Science, Oregon State University, Corvallis, Oregon
|
|
Rajeev K. Pandey
|
Department of Computer Science, Oregon State University, Corvallis, Oregon
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 8, Downloads (12 Months): 13, Citation Count: 1
|
|
|
ABSTRACT
The inherent parallelism of applicative languages such as APL and functional languages such as FP present a little-exploited and somewhat unorthodox means of parallel programming. Here we summarize our investigation of a new approach to compiling such programs for execution on various types of parallel hardware. Our method centers around an intermediate form that is an extension of the lambda calculus. We present evidence that APL programs are easily translated into this intermediate form, and that this intermediate representation lends itself readily to code generation for a variety of parallel hardware.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
|
 |
3
|
|
| |
4
|
H. P. Barendregt. The Lambda Calculus. North- Holland, (1984).
|
| |
5
|
|
| |
6
|
|
| |
7
|
D. S. Friedman and D. S. Wise. CONS should not evaluate its arguments. In S. Michaelson and R. Milner, editors, Automata, Languages, and Programming: Third Iniernatzonal Colloquium, pages 257-284. (1976).
|
 |
8
|
|
| |
9
|
|
| |
10
|
|
| |
11
|
|
 |
12
|
|
| |
13
|
|
 |
14
|
|
|