|
ABSTRACT
Throughout history, every time a new idea has come along there have been many people quick to criticize it. As often as not, such criticism has come from detractors of the idea, and has been motivated by its threat to older, more established beliefs. The Biblical prophets, Socrates, Jesus, Copernicus, Galileo, Pasteur, Marx, Darwin, Stravinsky, and countless others, all experienced resistance to their ideas for essentially emotional rather than intellectual reasons. From its early days as “Iverson Notation” through its more recent development, APL has been the target of heated discussion. This paper is a criticism of APL, but I believe, different from others. I am not a detractor of APL; in fact, I have been a supporter, developer, and promoter of the language for quite some time. Therefore, the intention of this review is not to suggest that since APL has faults it is worthless. To the contrary, I hope that these comments will lead to further improvements of APL and perhaps suggest some of the directions to consider in the development of its successors. This paper could not have been written much earlier. It is because APL has come of age, both in the theoretical domain and in the commercial world, that it is possible to look at it publicly with a critical eye. The discussion that follows is written for the APL community, present and future. My wish is that APL “believers” will accept this analysis in the constructive spirit in which it is offered, and that those who still do not appreciate the beauty, elegance, and practical power of APL will not take these comments out of the context in which they are presented.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
|
| |
3
|
P. S. Abrams, "Program Writing, Rewriting, and Style", APL Congress 73 (1973) 1-8
|
| |
4
|
J. A. Brown, A Generalization of APL, Ph.D. Dissertation, Syracuse University (1971)
|
| |
5
|
|
 |
6
|
|
| |
7
|
E. M. Edwards, "Generalized Arrays (Lists) in APL", APL Congress 73 (1973) 99-105
|
| |
8
|
A. D. Falkoff and K. E. Iverson, APLSV User's Manual, Philadelphia: IBM 1973
|
| |
9
|
|
| |
10
|
Z. Ghandour and J. E. Mezei, "General Arrays, Operators and Functions", IBM Journal of Research and Development, 17, 4 (July 1973) 335-352
|
| |
11
|
|
| |
12
|
P. Gjerløv, H. J. Helms, and J. Nielsen, APL Congress 73, Amsterdam: North-Holland Publishing Co. (1973)
|
| |
13
|
L. R. Harris, "A Logical Control Structure for APL", APL Congress 73 (1973) 203-210
|
| |
14
|
|
| |
15
|
K. E. Iverson, Elementary Functions: An Algorithmic Approach, Chicago: Science Research Associates, Inc. (1966)
|
| |
16
|
R. A. Kelley, "APLGOL, An Experimental Structured Programming Language", IBM Journal of Research and Development, 17, 1 (January 1973) 69-73
|
| |
17
|
R.H. Lathwell, and J. E. Mezei, "A Formal Description of APL", Colloque APL, Paris: IRIA (1971)
|
| |
18
|
D. McCracken, "Whither APL", Datamation, 16, 11 (15 September 1970) 53-55
|
| |
19
|
E. E. McDonnell, "Complex Floor", APL Congress 73, (1973) 299-305
|
| |
20
|
T. More Jr., "Axioms and Theorems for a Theory of Arrays", IBM Journal of Research and Development, 17, 2 (March 1973) 135-175
|
| |
21
|
R. C. Murray, "On Tree Structure Extensions to the APL Language", APL Congress 73, (1973) 333-338
|
 |
22
|
|
| |
23
|
A. J. Rose, "More About Multi-Adic Functions", APL Quote Quad, 2, 6 (March 1971) 3-4
|
| |
24
|
L. Ryan, "Secure Applications Within an APL Environment", APL Congress 73 (1973) 407-414
|
CITED BY 12
|
|
H. Pottinger , W. Eatherton , J. Kelly , T. Schiefelbein , L. R. Mullin , R. Ziegler, Hardware assists for high performance computing using a mathematics of arrays, Proceedings of the 1995 ACM third international symposium on Field-programmable gate arrays, p.39-45, February 12-14, 1995, Monterey, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|