Compiling APL: the Yorktown APL translator
IBM Journal of Research and Development
An APL compiler
Supercompilers for parallel and vector computers
Supercompilers for parallel and vector computers
Fortran 90 handbook: complete ANSI/ISO reference
Fortran 90 handbook: complete ANSI/ISO reference
Compiler transformations for high-performance computing
ACM Computing Surveys (CSUR)
An introduction to STSC's APL compiler
APL '85 Proceedings of the international conference on APL: APL and the future
APL '85 Proceedings of the international conference on APL: APL and the future
The implementation and evaluation of fusion and contraction in array languages
PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Loop fusion in high performance Fortran
ICS '98 Proceedings of the 12th international conference on Supercomputing
APL '98 Proceedings of the APL98 conference on Array processing language
High Performance Compilers for Parallel Computing
High Performance Compilers for Parallel Computing
IFL '96 Selected Papers from the 8th International Workshop on Implementation of Functional Languages
A programming language
Implementing the NAS Benchmark MG in SAC
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
HPF vs. SAC - A Case Study (Research Note)
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Shared memory multiprocessor support for functional array processing in SAC
Journal of Functional Programming
A binding scope analysis for generic programs on arrays
IFL'05 Proceedings of the 17th international conference on Implementation and Application of Functional Languages
Hi-index | 0.00 |
The paper investigates, how SAC, a purely functional language based on C syntax, relates to APL in terms of expressiveness and run-time behavior. To do so, three different excerpts of real world APL programs are examined. It is shown that after defining the required APL primitives in SAC, the example programs can be re-written in SAC with an almost one-to-one correspondence. Run-time comparisons between interpreting APL programs and compiled SAC programs show that speedups due to compilation vary between 2 and 500 for three representative benchmark programs.