Trees as nested arrays and the use of underdisclose

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Trees as nested arrays and the use of underdisclose

Full text

Pdf (407 KB)

Source

International Conference on APL archive
Proceedings of the international conference on APL: APL in transition table of contents

Dallas, Texas, United States

Pages: 157 - 162

Year of Publication: 1987

ISBN:0-89791-226-8

Also published in ...

Author

G. C. Nauta

Océ Nederland B.V., P.O. Box 101, NL-5900 MA Venlo, The Netherlands

Sponsor

SIGAPL: ACM Special Interest Group on APL Programming Language

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

abstract references 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/28315.28333 What is a DOI?

ABSTRACT

A notation is presented to denote a tree as a vector, using nested arrays. The construction of a tree as well as operations on it, make use of the operator under (also called each) and the function disclose. The definition of a new operator useful for the handling of nested arrays is given.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	K.E. Iverson, A dictionary of APL, july 1986, publication code 0402 8607 E2, Canada.
	2	G.C. Nauta, Setabstraction in APL, august 1986, graduation report, University of Twente, Enschede, The Netherlands.

CITED BY 2

	David Steinbrook , Eugene McDonnell, From trees into boxes, ACM SIGAPL APL Quote Quad, v.24 n.1, p.267-276, Aug. 1993
	Kenneth J. Fordyce, A bibliography of APL articles on modeling and KBES, ACM SIGAPL APL Quote Quad, v.21 n.1, p.12-18, Sept. 1990