Indexing and indexed replacement in APL

Authors:
Roland H. Pesch
Affiliations:
APL Development Group, I.P. Sharp Associates, Inc., Suite 201, 220 California Ave., Palo Alto, California
Venue:
APL '81 Proceedings of the international conference on APL
Year:
1981

Citing 3
Cited 4

Formalism in programming languages

Communications of the ACM
Operators in an APL containing nested arrays

ACM SIGAPL APL Quote Quad
A programming language

A programming language

Indexing and merging in APL

APL '88 Proceedings of the international conference on APL
The hunting of the Snark

APL '82 Proceedings of the international conference on APL
Practical uses of a model of APL

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

APL '82 Proceedings of the international conference on APL

Quantified Score

Hi-index	0.00

Visualization

Abstract

Indexing and indexed replacement have an exceptional syntax. Enclosed arrays make this syntax unnecessary. An operator with an ambivalent derived function is proposed as the solution. The monadic case performs selection; the dyadic case, replacement.