Representing data structures in APL with an extended enclosure function

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Representing data structures in APL with an extended enclosure function

Full text

Pdf (285 KB)

Source

ACM SIGAPL APL Quote Quad archive
Volume 17 , Issue 2 (December 1986) table of contents

Pages: 9 - 12

Year of Publication: 1986

ISSN:0163-6006

Author

J Thornburg

Dept. of Geophysics and Astronomy, The University of British Columbia, Vancouver, B.C., Canada V6T lW5

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 6, Citation Count: 1

Additional Information:

abstract cited by index terms

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/9327.9329 What is a DOI?

ABSTRACT

We propose a natural extension of the "enclose" general array function, and describe its use in representing complicated data structures such as trees with (possibly) shared branches. We give two examples of the use of the extension, one each in symbolic algebra and in graphics.

CITED BY

Jean-Jacques Girardot, Arrays and references, ACM SIGAPL APL Quote Quad, v.20 n.4, p.161-172, July 1990

INDEX TERMS

Classification:
D. Software
D.3 PROGRAMMING LANGUAGES
D.3.2 Language Classifications

Nouns: APL

E. Data
E.1 DATA STRUCTURES
Subjects: Trees