Control of structure and evaluation
APL '85 Proceedings of the international conference on APL: APL and the future
Structural experiments with arrays of functions
APL '85 Proceedings of the international conference on APL: APL and the future
Syntactic experiments with arrays of functions and operators
APL '84 Proceedings of the international conference on APL
Function assignment and arrays of functions
APL '84 Proceedings of the international conference on APL
Cultivating trees - an essay in APL2
APL '84 Proceedings of the international conference on APL
Valence and precedence in APL extensions
APL '83 Proceedings of the international conference on 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
APL '88 Proceedings of the international conference on APL
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
The A+ programming language, a different APL
APL '90 Conference proceedings on APL 90: for the future
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
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
Structuring functions with operators
APL '93 Proceedings of the international conference on APL
APL '98 Proceedings of the APL98 conference on Array processing language
Hi-index | 0.00 |
Much has been written on the-possibility of incorporating arrays of functions and arrays of operators into APL. Various methods have been proposed for creating and restructuring such arrays. This paper proposes the introduction of arrays of operations in general into APL2. Vector notation is extended, as suggested by Brown and Benkard, to allow easy creation of vectors of operations. A new object, called an ELEVATOR, is introduced in order to create operations for manipulating arrays of operations. The semantics of the jot is extended, as per Benkard, to provide a means of extracting structural information from operation arrays.An analysis of the meaning behind the new notation is undertaken. Definitions are given which not only satisfy the notational requirements but also provide insights into the nature of structural operations on function arrays. The information retained in an empty function array is explained, and the relationship between the primitive ENCLOSE function and the EACH operator becomes clear.