Fitting spheres by the method of least squares

to construct a more efficient program th,,m would ()ther-wise be possible. We propos(, that such information should be given in ~t standard form, although not every compiler would necessarily t)e able [,o use it. We have in mind particularly that the progrt~mmer should communicate to the compiler informaiiion thai; would enable it to allocate high-speed storage in the most e{ficient manner, and also to make efficient use of any available auxiliary storage. We propose that compiling information should be introduced by the delimiter note. 4 We give below examples of the type of information that might be given, but we do not wish at. the present time to make firm proposals for a complete range of standard forms. /tote drum b(1, n) Indicates that the array b can be stored on a drum. note retire c(1, re) Indicates that the array c is "sleepy" revive d(1, n) and will not he used again until further notice, and that the array d previously retired is now to be revived. A retired array can be deposited in an auxiliary store and its place in the high-speed store freed for other use. note undeclare a(l, n) Indicates that the array a will not be used again and that the storage space occupied hy it; can be real-located. The use made by a compiler of n o t e will depend on the nature of the compiler and of the properties of the computer with which it is used. For example, "retire" will act like a statement and will cause to be compiled a group of orders which, when the program is run, will transfer the array in question to an auxiliary store; similarly "revive" will cause compilation of a group of orders which will cause the array to be brought down into the high-speed store. On the other hand, " d r u m " will act more like a declaration. It will not itself bring about the compilation of orders, but will ensure that the array in question is stored on a drum and called down whenever it is required. In general the type of information given after the delimiter n o t e will be readily available for the programmer , although perhaps quite difficult to deduce from the AIx;oL program itself. I t is to be noted that an ALGO[~ program ah'eady contains some redundant information of this kind in …