Affiliation:
1. General Motors Research Lab, Warren, MI
Abstract
An oft-mentioned advantage of ALGOL over FORTRAN is the recursion capability of the former. FORTRAN adherents often belittle this advantage by claiming that all recursive relations can be reduced to recurrence or iterative relations, or that no recursive relations exist which are worth coding as recursive relations. The question of the truth of this must be left unanswered here. It is hoped that the technique described below will draw the poison from the FORTRANers' wounds by allowing them to recurse to their complete satisfaction. There is an hereditary resemblance between this technique and the MAD (Michigan Algorithm Decoder) recursion technique.
Publisher
Association for Computing Machinery (ACM)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The PORT Mathematical Subroutine Library;ACM Transactions on Mathematical Software;1978-06
2. Programming recursively defined functions infortran;International Journal of Computer & Information Sciences;1976-06
3. Bibliography;Data Structures;1971
4. Distribution of the Time Through a Directed, Acyclic Network;Operations Research;1965-02
5. On the recursive programming techniques;Communications of the ACM;1964-05