Programming recursively defined functions in fortran

Abstract

Various approaches to the problem of programming recursively defined functions in fortran are discussed. The only acceptable method in ASA fortran is shown to be most easily programmed using a stack containing not addresses, but function arguments. The stack is built up and, when full, the function is constructed from the stack elements. A sequence of examples of increasing complexity is given to demonstrate the technique, including one in which a queue is found to be more appropriate than a stack. The emphasis throughout is on the simplicity of the technique. © 1976 Plenum Publishing Corporation.