Research and Advances

Bessel functions of integral order and complex argument

Posted

The FORTRAN II source language [1, 2] places rather severe restrictions on the form a subscript may take, primarily because of the manner in which indices are incremented in iterative loops. In the process of constructing a compiler for a medium-sized (8008-word memory) computer which will accept the FORTRAN II source language, it became clear that the “recursive address calculation” scheme, as used in the FORTRAN compilers to minimize object-program running time, was probably not the best one to use. This system, described in some detail by Samelson and Bauer [3], requires that the subscript expression be a linear function of the subscripting variable. The alternative, which requires complete evaluation of the “storage mapping function”, is usually rejected because of the time required for the object program to perform the necessary address calculation.

View this article in the ACM Digital Library.

Join the Discussion (0)

Become a Member or Sign In to Post a Comment

The Latest from CACM

Shape the Future of Computing

ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.

Get Involved

Communications of the ACM (CACM) is now a fully Open Access publication.

By opening CACM to the world, we hope to increase engagement among the broader computer science community and encourage non-members to discover the rich resources ACM has to offer.

Learn More