Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Compiling APL: the Yorktown APL translator
IBM Journal of Research and Development
Program analysis and code generation in an APL/370 compiler
IBM Journal of Research and Development
APL—compilation-where does the time come from?
APL '87 Proceedings of the international conference on APL: APL in transition
An introduction to function rank
APL '88 Proceedings of the international conference on APL
An empirical study of the performance of the APL370 compiler
APL '89 Conference proceedings on APL as a tool of thought
ACORN: APL to C on real numbers
APL '90 Conference proceedings on APL 90: for the future
APL '90 Conference proceedings on APL 90: for the future
APL '85 Proceedings of the international conference on APL: APL and the future
An APL compiler for the UNIX timesharing system
APL '83 Proceedings of the international conference on APL
A performance comparison between an APL interpreter and compiler
APL '83 Proceedings of the international conference on APL
The role of APL and J in high-performance computation
APL '93 Proceedings of the international conference on APL
Is APL2 a good programming language?
APL '95 Proceedings of the international conference on Applied programming languages
The role of dynamic programming & control structures in performance
APL '95 Proceedings of the international conference on Applied programming languages
Reducing computational complexity with array predicates
APL '98 Proceedings of the APL98 conference on Array processing language
Hi-index | 0.00 |
Array morphology is the study of the form, structure, and evolution of arrays. An array annotation for a program written in an applicative array language is an abstract syntax tree for the program, amended with information about the arrays created by that program. Array notations are useful in the production of efficient compiled code for applicative array programs. Array morphology is shown to be an effective compiler writer's tool. Examples of an array annotator in action are presented, showing its value in array morphology. Array morphology is shown to provide methods for static detection of certain classes of programming errors.Assertions are a generalization of declarations that offer significant benefits to application writers as well as compiler writers. Although assertions are executable code, they can often be evaluated at compilation time. Assertions, and therefore declarations, may be represented as conjunctions, and are, therefore, conforming extensions to ISO Standard APL. A domain conjunction is offered as an example of how assertions might be defined in APL or J.