Analysis of function applications in deep arrays

Authors:
J. Philip Benkard
Affiliations:
Staff Programmer, Subproducts Systems Engineering, International Business Machines Corporation, Dept 262/Bldg 938, P. O. Box 950, Poughkeepsie, New York
Venue:
APL '86 Proceedings of the international conference on APL
Year:
1986

Citing 5
Cited 8

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
Cultivating trees - an essay in APL2

APL '84 Proceedings of the international conference on APL
Designing and implementing an array theory incorporating abstract datatypes

APL '83 Proceedings of the international conference on APL
The role of operators in APL

APL '79 Proceedings of the international conference on APL: part 1

Replicate each, anyone?

APL '87 Proceedings of the international conference on APL: APL in transition
Implications of APL2 grammar

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
Phrasal forms

APL '89 Conference proceedings on APL as a tool of thought
Arrays and references

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
Structuring functions with operators

APL '93 Proceedings of the international conference on APL

Quantified Score

Hi-index	0.00

Visualization

Abstract

Function arrays are easy to understand in APL when the leaves are primitive scalar functions. Herein other kinds of functions, called generically subscalars, are studied as items in functions arrays. Some example primitive shave an internal analog of structure. They are explicated using an experimental DEPTH operator and some defined subprimitive functions. Subscalar leaves of function arrays interrupt the promulgation of scalar conformance in a resumable fashion reminiscent of the data types of Kajiya [6].