Thumbnail
Access Restriction
Subscribed

Author Gull, W. E. ♦ Jenkins, M. A.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Trees ♦ Data-driven algorithms ♦ Apl arrays ♦ Nested arrays ♦ Theory of arrays ♦ Recursive data structures
Abstract A mathematical study of three approaches for defining nested arrays in APL is presented. Theorems exhibiting the relationships between the definitional systems are given and illustrated through graph representations. One of the approaches is used to define an APL array to be a recursive data structure equivalent to a tree structure in which all data is stored at the leaves as homogeneous arrays of numbers and characters. An extension of APL is proposed that includes new primitive functions to manipulate the nesting level of arrays and new operators to assist in the construction of data-driven algorithms.
Description Affiliation: Univ. Zürich, Zürich, Switzerland (Gull, W. E.) || Queen's Univ., Kingston, Canada (Jenkins, M. A.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 22
Issue Number 2
Page Count 18
Starting Page 79
Ending Page 96


Open content in new tab

   Open content in new tab
Source: ACM Digital Library