Dynamic storage routines for Fortran programs

Authors:
David W. Bray
Affiliations:
Clarkson College of Technology, Potsdam, New York
Venue:
ACM SIGPLAN Notices
Year:
1974

Citing 2
Cited 1

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Symmetric list processor

Communications of the ACM

The EXEC 8 implementation of LIST PROCESSOR-N

ACM SIGPLAN Notices

Quantified Score

Hi-index	0.00

Visualization

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.