PL360, a Programming Language for the 360 Computers
Journal of the ACM (JACM)
Contemporary Concepts of Microprogramming and Emulation
ACM Computing Surveys (CSUR)
The structure of the “THE”-multiprogramming system
Communications of the ACM
A proposal for definitions in ALGOL
Communications of the ACM
A microprogrammed implementation of EULER on IBM system/360 model 30
Communications of the ACM
EULER: a generalization of ALGOL, and its formal definition: Part II
Communications of the ACM
Recursive functions of symbolic expressions and their computation by machine, Part I
Communications of the ACM
A programming language
The introduction of definitional facilities into higher level programming languages
AFIPS '66 (Fall) Proceedings of the November 7-10, 1966, fall joint computer conference
Language directed computer design
AFIPS '67 (Fall) Proceedings of the November 14-16, 1967, fall joint computer conference
AFIPS '67 (Fall) Proceedings of the November 14-16, 1967, fall joint computer conference
Burroughs' B6500/B7500 stack mechanism
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
On the basis for ELF: an extensible language facility
AFIPS '68 (Fall, part II) Proceedings of the December 9-11, 1968, fall joint computer conference, part II
Unconventional superspeed computer systems
AFIPS '71 (Spring) Proceedings of the May 18-20, 1971, spring joint computer conference
Future trends in software development for real-time industrial automation
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Distributed intelligence for user-oriented computing
AFIPS '72 (Fall, part II) Proceedings of the December 5-7, 1972, fall joint computer conference, part II
Software sympathetic chip set design
AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference
| Hi-index | 0.00 |
Learning to program in a general-purpose, high-level language is a formidable task for a person who simply wishes to use the computer to solve his problems. He must learn how to express his problems in algorithmic form in the language, the constraints and idiosyncrasies of the language, and the mechanics of running a program on his computer. If he wishes his programs to be efficient, he must learn which constructions in the language use the machine effectively and which do not. This is complicated by the unpleasant fact that effectiveness in the language may not correspond to effectiveness in the machine. A concise, well constructed statement may use much more machine time than an ungainly structure that does the same thing.