A new polynomial-time algorithm for linear programming
Combinatorica
An APL/370 compiler and some performance comparisons with APL interpreter and FORTRAN
APL '86 Proceedings of the international conference on APL
APL '86 Proceedings of the international conference on APL
ACM SIGAPL APL Quote Quad
A review and analysis of Fortran 8x
ACM SIGNUM Newsletter
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
ACM SIGPLAN Notices
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
Efficiency in the APL environment—a full arsenal for attacking CPU hogs
APL '85 Proceedings of the international conference on APL: APL and the future
APL '84 Proceedings of the international conference on APL
An APL compiler for the UNIX timesharing system
APL '83 Proceedings of the international conference on APL
APL '79 Proceedings of the international conference on APL: part 1
A programming language
APL '92 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
| Hi-index | 0.00 |
Excellent application performance should not require tour de force programming efforts by users. Fortran 90 in an attempt to bring it from a scalar orientation into an array notation, has adopted some of the early concepts of APL, such as array operations. The introduction of these ideas is shown to be inadequate meeting the algorithmic needs of programmers, in terms of expressiveness, consistency, and conciseness. Comparisons with APL show Fortran 90 to be a mongrel, neither scalar- nor array-oriented, unable achieve the levels of productivity, performance, reliability, and maintainability required by computer users in the 1990s.