Recursive data structures and related control mechanisms in APL

Authors:
W. E. Gull;M. A. Jenkins
Affiliations:
-;-
Venue:
APL '76 Proceedings of the eighth international conference on APL
Year:
1976

Citing 3
Cited 4

Recursive functions of symbolic expressions and their computation by machine, Part I

Communications of the ACM
Uses of general arrays and operators

APL '74 Proceedings of the sixth international conference on APL
The design of APL

IBM Journal of Research and Development

Recursive data structures in APL

Communications of the ACM
Designing and implementing an array theory incorporating abstract datatypes

APL '83 Proceedings of the international conference on APL
A survey of extensions to APL

APL '82 Proceedings of the international conference on APL
Evaluating extensions to APL

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

Quantified Score

Hi-index	0.02

Visualization

Abstract

A brief description of a recursive data structure extension for APL is given which allows the construction of tree-like data structures with no explicit sharing. The proposal includes new and extended primitive functions for constructing data structures and for selecting substructures and two operators which may be used to apply a function at every, node on the first level or at the leaves of a tree respectively. Examples are drawn from algebraic manipulation, computer graphics and natural language manipulation.