skip to main content
article
Free Access

Dynamic storage routines for Fortran programs

Published:01 September 1974Publication History
Skip Abstract Section

Abstract

This paper describes a set of list processing routines which augment the capabilities of FORTRAN by providing the programmer with the ability to dynamically allocate arbitrarily complicated data structures. The basic structure provided is a two dimensional array.

References

  1. D. E. Knuth, "The Art of Computer Programming: Fundamental Algorithms," Addison Wesley, Reading, Ma. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. J. Weizenbaum, "Symmetric List Processor," Comm. of the ACM, Vol. 6, pp. 524--544, (1963). Google ScholarGoogle ScholarDigital LibraryDigital Library

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in

Full Access

  • Published in

    cover image ACM SIGPLAN Notices
    ACM SIGPLAN Notices  Volume 9, Issue 9
    September 1974
    31 pages
    ISSN:0362-1340
    EISSN:1558-1160
    DOI:10.1145/953214
    Issue’s Table of Contents

    Copyright © 1974 Author

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 1 September 1974

    Check for updates

    Qualifiers

    • article

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader