An APL/370 compiler and some performance comparisons with APL interpreter and FORTRAN
APL '86 Proceedings of the international conference on APL
Field results with the APL compiler
APL '86 Proceedings of the international conference on APL
ACORN: APL to C on real numbers
APL '90 Conference proceedings on APL 90: for the future
Advanced Array Optimizations for High Performance Functional Languages
IEEE Transactions on Parallel and Distributed Systems
An introduction to STSC's APL compiler
APL '85 Proceedings of the international conference on APL: APL and the future
Communications of the ACM
Global optimization by suppression of partial redundancies
Communications of the ACM
Types and programming languages
Types and programming languages
An APL compiler for the UNIX timesharing system
APL '83 Proceedings of the international conference on APL
Single Assignment C: efficient support for high-level array operations in a functional setting
Journal of Functional Programming
On optimising shape-generic array programs using symbolic structural information
IFL'06 Proceedings of the 18th international conference on Implementation and application of functional languages
A binding scope analysis for generic programs on arrays
IFL'05 Proceedings of the 17th international conference on Implementation and Application of Functional Languages
ACM SIGAPL APL Quote Quad
Descriptor-free representation of arrays with dependent types
IFL'08 Proceedings of the 20th international conference on Implementation and application of functional languages
CEFP'11 Proceedings of the 4th Summer School conference on Central European Functional Programming School
Hi-index | 0.00 |
Compiling indexing operations on n-dimensional arrays into efficiently executable code is a challenging task. This paper focuses on the reduction of offset computations as they typically occur when transforming index vectors into offsets for linearized representations of n-dimensional arrays. We present a high-level optimization to that effect which is generally applicable, even in the presence of statically unknown rank (n). Our experiments show run-time improvements between a factor of 2 and 16 on a set of real-world benchmarks.