Compilation and delayed evaluation in APL
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A general scheme for the automatic inference of variable types
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Type checking in an imperfect world
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The caret functions: Efficient algorithms for scans and reductions of eight Boolean functions
APL '74 Proceedings of the sixth international conference on APL
Tentative compilation: a design for an apl compiler.
Tentative compilation: a design for an apl compiler.
Compiling APL: the Yorktown APL translator
IBM Journal of Research and Development
Compiling APL for parallel execution on an FFP machine
APL '85 Proceedings of the international conference on APL: APL and the future
Carrier arrays: an idiom-preserving extension to APL
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Paging as a "language processing" task
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A brief history of just-in-time
ACM Computing Surveys (CSUR)
Riposte: a trace-driven compiler and parallel VM for vector code in R
Proceedings of the 21st international conference on Parallel architectures and compilation techniques
| Hi-index | 0.00 |
The overall design of an APL compiler which achieves significant savings of temporary storage is outlined. A graphical intermediate representation for APL expressions is described. Transformations which may be applied to this intermediate representation to select improved array access orders are presented with examples of the storage savings obtained.