The IBM 701 Speedcoding System
Journal of the ACM (JACM)
The PACT I Coding System for the IBM Type 701
Journal of the ACM (JACM)
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
The arithmetic translator-compiler of the IBM FORTRAN automatic coding system
Communications of the ACM
A Discipline of Programming
Programming Languages: History and Fundamentals
Programming Languages: History and Fundamentals
Programming languages and their compilers: Preliminary notes
Programming languages and their compilers: Preliminary notes
FORTRAN IV with WATFOR and WATFIV
FORTRAN IV with WATFOR and WATFIV
Version control in families of large programs
ICSE '87 Proceedings of the 9th international conference on Software Engineering
A Simplified Framework for Reduction in Strength
IEEE Transactions on Software Engineering
Functional languages in microcode compilers
MICRO 22 Proceedings of the 22nd annual workshop on Microprogramming and microarchitecture
IEEE Transactions on Computers
Language support for Morton-order matrices
PPoPP '01 Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programming
Adaptive Optimizing Compilers for the 21st Century
The Journal of Supercomputing
IEEE Annals of the History of Computing
Ahnentafel Indexing into Morton-Ordered Arrays, or Matrix Locality for Free
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Programming methodology
Sourcebook of parallel computing
Improving effective bandwidth through compiler enhancement of global cache reuse
Journal of Parallel and Distributed Computing
Ancestor worship in CS1: on the primacy of arrays
OOPSLA '04 Companion to the 19th annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
Encyclopedia of Computer Science
Fast additions on masked integers
ACM SIGPLAN Notices
Some Experiments in Local Microcode Compaction for Horizontal Machines
IEEE Transactions on Computers
From FORTRAN 77 to locality-aware high productivity languages for peta-scale computing
Scientific Programming - Fortran Programming Language and Scientific Programming: 50 Years of Mutual Growth
A technological review of the FORTRAN I compiler
AFIPS '82 Proceedings of the June 7-10, 1982, national computer conference
The history of language processor technology in IBM
IBM Journal of Research and Development
In memoriam: John McCarthy, 1927-2011
Artificial Intelligence in Medicine
Spill code placement for SIMD machines
SBLP'12 Proceedings of the 16th Brazilian conference on Programming Languages
Restructuring Fortran legacy applications for parallel computing in multiprocessors
The Journal of Supercomputing
Hi-index | 0.01 |
Before 1954 almost all programming was done in machine language or assembly language. Programmers rightly regarded their work as a complex, creative art that required human inventiveness to produce an efficient program. Much of their effort was devoted to overcoming the difficulties created by the computers of that era: the lack of index registers, the lack of built- in floating point operations, restricted instruction sets (which might have AND but not OR, for example), and primitive input- output arrangements. Given the nature of computers, the services which “automatic programming” performed for the programmer were concerned with overcoming the machine's shortcomings. Thus the primary concern of some “automatic programming” systems was to allow the use of symbolic addresses and decimal numbers (e.g., the MIDAC Input Translation Program [Brown and Carr 1954]). But most of the larger “automatic. Programming” systems (with the exception of Laning and Zierler's algebraic system [Laning and Zierler 1954] and the A-2 compiler [Remington Rand 1953; Moser 1954]) simply provided a synthetic “computer” with an order code different from that of the real machine. This synthetic computer usually had floating point instructions and index registers and had improved input-output commands; it was therefore much easier to program than its real counterpart.