“Extension of APL to tree-structured information”

  • Authors:
  • M. Alfonseca;M. L. Tavera

  • Affiliations:
  • -;-

  • Venue:
  • APL '76 Proceedings of the eighth international conference on APL
  • Year:
  • 1976

Quantified Score

Hi-index 0.02

Visualization

Abstract

A new outlook on the APL system management together with a new set of primitive functions are proposed to be included in the APL language to manage tree-structured information. Since the appearance of APL, this language has been prone to extension requirements, possibly due to the fact that it allows such an ease of computing and programming, that the user quickly arrives to the point where he should like to have something else to make even more complex procedures with even less programming effort. Some of such requirements have been accepted and are now operative, namely the execute and formatting functions and the scan operator. Our approach has selected the planar tree as a new APL object. Stress has been applied to the minimization of the number of primitive functions and symbols extensions needed to handle the new objects as well as the maintaining of a maximum coherence between our extensions and the standard APL operations. In addition to this, a new work space library organization is proposed in order to overcome the limitations inherent to the present limited work space size and file management.