User defined data types in APL2

Authors:
J. P. Benkard;J. A. Brown
Affiliations:
IBM East Fishkill, Route 52, Hopewell Junction, New York 12533;IBM Santa Teresa Lab J98/B25, 555 Bailey Ave., P.O. Box 49023, San Jose, Calif.
Venue:
APL '89 Conference proceedings on APL as a tool of thought
Year:
1989

Citing 12
Cited 5

A notation for manipulating arrays of operations

APL '86 Proceedings of the international conference on APL
Analysis of function applications in deep arrays

APL '86 Proceedings of the international conference on APL
Replicate each, anyone?

APL '87 Proceedings of the international conference on APL: APL in transition
A dictionary of APL

ACM SIGAPL APL Quote Quad
The theory of function arrays

APL '88 Proceedings of the international conference on APL
What is an argument?

APL '89 Conference proceedings on APL as a tool of thought
The structure and content of APL data

APL '89 Conference proceedings on APL as a tool of thought
APL two by two-syntax analysis by pairwise reduction

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
Nonpositional indexing for a relational data base

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

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

Arrays and references

APL '90 Conference proceedings on APL 90: for the future
APLELEGANCE—the art of staying within one's depth

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
Is APL2 a good programming language?

APL '95 Proceedings of the international conference on Applied programming languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is an investigation of possible definitions of new enclose-like functions, their impact on the APL2 language, and their usefulness in applications. Several variants of enclose have been proposed over the years that range from data structure primitives to data type producing primitives. Operator analogues of enclose can be used to create functions that pervade structures and types in different ways. Defined operators can implement type hierarchy and respond to fill items in prototype execution by referring to tables of type characteristics.