SNOBOL , A String Manipulation Language
Journal of the ACM (JACM)
TRAC, a procedure-describing language for the reactive typewriter
Communications of the ACM
Syntax macros and extended translation
Communications of the ACM
An assembly language for reprogramming
Communications of the ACM
Macro instruction extensions of compiler languages
Communications of the ACM
The mobile programming system: STAGE2
Communications of the ACM
Communications of the ACM
A base for a mobile programming system
Communications of the ACM
Communications of the ACM
APL '75 Proceedings of seventh international conference on APL
A survey of the systematic use of macros in systems building
Proceedings of the SIGPLAN symposium on Languages for system implementation
Syntax translation with context macros or macros without arguments
Proceedings of the international symposium on Extensible languages
A history of the SNOBOL programming languages
ACM SIGPLAN Notices - Special issue: History of programming languages conference
A graded bibliography on macro systems and extensible languages
ACM SIGPLAN Notices
SOSP '69 Proceedings of the second symposium on Operating systems principles
A history of the SNOBOL programming languages
History of programming languages I
Programming Languages The First 25 Years
IEEE Transactions on Computers
An efficient system for user extendible languages
AFIPS '68 (Fall, part II) Proceedings of the December 9-11, 1968, fall joint computer conference, part II
SYMPLE: a general syntax directed macro preprocessor
AFIPS '69 (Fall) Proceedings of the November 18-20, 1969, fall joint computer conference
ETC: an extendible macro-based compiler
AFIPS '71 (Spring) Proceedings of the May 18-20, 1971, spring joint computer conference
GPMX: a portable general purpose macro processor adapted for preprocessing FORTRAN
AFIPS '76 Proceedings of the June 7-10, 1976, national computer conference and exposition
IBM Systems Journal
| Hi-index | 48.28 |
The problem of obtaining starting values for the Newton-Raphson calculation of √x on a digital computer is considered. It is shown that the conventionally used best uniform approximations to √x do not provide optimal starting values. The problem of obtaining optimal starting values is stated, and several basic results are proved. A table of optimal polynomial starting values is given.