Skip to main content
SpringerLink
Log in

An APL approach to the representation and manipulation of data structures

  • Published:
International Journal of Computer & Information Sciences Aims and scope Submit manuscript

Abstract

One of the important characteristics of a programming language is the manner in which commonly used data structures can be represented and manipulated. Methods for the representation of complex data structures in APL, a programming language based on rectangular arrays and a multiplicity of functions, are presented in this paper. Data structures considered are: strings and sets, stacks and queues, tables, linked lists, and sort trees. The material provides insight into the nature of data structures and should aid in establishing future requirements for primal and base languages.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. T. R. Bashkow, A. Sasson, and A. Kronfeld, “System design of a FORTRAN machine,”IEEE Trans. Electronic Computers EC-16:485–499 (1967).

    Google Scholar 

  2. A. T. Bergtiss,Data Structures: Theory and Practice (Academic Press, New York, 1971).

    Google Scholar 

  3. H. W. Bingham, “Use of APL microprogrammable machine modeling,” inProc. of SIGPLAN Symposium on Languages for Systems Implementation (Association for Computing Machinery, October 1971), pp. 105–109.

  4. A. D. Falkoff and K. E. Iverson,APL/360 User's Manual (IBM Corporation, T. J. Watson Research Center, Yorktown Heights, N.Y., 1968) (Also available as IBM form GH20-0683).

  5. A. D. Falkoff, K. E. Iverson, and E. H. Sussenguth, “A formal description of System/360,”IBM Systems J. 3(3):198–261 (1964).

    Google Scholar 

  6. I. Flores,Data Structure and Management (Prentice-Hall, Englewood Cliffs, N.J., 1970).

    Google Scholar 

  7. S. Husson,Microprogramming: Principles and Practices (Prentice-Hall, Englewood Cliffs, N.J., 1970).

    Google Scholar 

  8. K. E. Iverson,A Programming Language (John Wiley and Sons, New York, 1962).

    Google Scholar 

  9. H. Katzan, “Representation and manipulation of data structures in APL,” inProc. of SIGPLAN Symposium on Data Structures in Programming Languages (Association for Computing Machinery, February 1971), pp. 366–397.

  10. H. Katzan,APL User's Guide (Van Nostrand-Reinhold, New York, 1971).

    Google Scholar 

  11. D. E. Knuth,The Art of Computer Programming, Vol. I, Fundamental Algorithms (Addison-Wesley, Reading, Mass., 1968).

    Google Scholar 

  12. A. J. Melbourne and J. M. Pugmire, “A small computer for the direct processing of FORTRAN statements,”Computer J. 8:24–27 (1968).

    Google Scholar 

  13. M. Sugimto, “PL/I reducer and direct processor,” inProc. 24th ACM National Conference,1969, pp. 519–538.

  14. K. J. Thurber and J. W. Myrna, “System design of a cellular APL computer,”IEEE Trans. Computers C-19(4):291–303 (1970).

    Google Scholar 

  15. H. Weber, “A microprogrammed implementation of EULER on IBM 360/30,”Commun. ACM 10:549–558 (1967).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Pratt Institute, Brooklyn, New York

    Harry Katzan Jr.

Authors
  1. Harry Katzan Jr.
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Katzan, H. An APL approach to the representation and manipulation of data structures. International Journal of Computer and Information Sciences 1, 93–113 (1972). https://doi.org/10.1007/BF00995734

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00995734

Keywords

Search

Navigation