Recursive data structures in APL
Communications of the ACM
Some ideas on data types in high-level languages
Communications of the ACM
The Smalltalk-76 programming system design and implementation
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Operators in an APL containing nested arrays
ACM SIGAPL APL Quote Quad
Whither (wither?) control structures?
ACM SIGAPL APL Quote Quad
Special control structures for APL
ACM SIGAPL APL Quote Quad
Adding a modern control structure to APL without changing the syntax
APL '76 Proceedings of the eighth international conference on APL
Recursive data structures and related control mechanisms in APL
APL '76 Proceedings of the eighth international conference on APL
Generic functions by nonstandard name scoping in APL
APL '81 Proceedings of the international conference on APL
ACM SIGAPL APL Quote Quad
Analysis of function applications in deep arrays
APL '86 Proceedings of the international conference on APL
An object oriented extension to APL
APL '87 Proceedings of the international conference on APL: APL in transition
APL '87 Proceedings of the international conference on APL: APL in transition
User defined data types in APL2
APL '89 Conference proceedings on APL as a tool of thought
APL '89 Conference proceedings on APL as a tool of thought
APL '90 Conference proceedings on APL 90: for the future
Extending structure, type, and expression in APL2
APL '91 Proceedings of the international conference on APL '91
Nested arrays and operators: some issues in depth
APL '92 Proceedings of the international conference on APL
Walks into the APL design space
APL '92 Proceedings of the international conference on APL
Rank vs depth for array partitioning
APL '84 Proceedings of the international conference on APL
Hi-index | 0.00 |
We describe a variant of More's array theory which has an extra function we call promotion. This function effects an abstract datatype facility very similar to Smalltalk classes. We discuss how the addition of promotion solves some programming language design issues not addressed by standard array theory as well as extending the expressive power of array theory. Finally we discuss how the inclusion of classes simplifies the implementation of not only array theory but also present day APL interpreters as well.