Goodman Annual Review in Automatic Programming

Papers Read at the Working Conference on Automatic Programming of Digital Computers Held at Brighton, 1-3 April 1959
1. Auflage 2014
ISBN: 978-1-4831-5400-8
Verlag: Elsevier Science & Techn.
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 312 Seiten, Web PDF

Annual Review in Automatic Programming is a collection of papers presented at the Working Conference on Automatic Programming of Digital Computers held in Brighton, UK, on April 1-3, 1959. Contributors focus on developments in automatic programming and cover topics ranging from automatic coding for TREAC to the PEGASUS and MERCURY autocodes, automatic programming of DEUCE, and the philosophy of programming. Business applications of automatic programming are also discussed. This book is comprised of 17 chapters and begins with a review of future trends in automatic programming, focusing on the environment of a computer as well as machine languages and automatic codes. The features of existing automatic programming languages are also described, along with the advantages and disadvantages of such languages. The next chapter presents some of the arguments in favor of standardized notations for programming, mainly with reference to scientific problems. The reader is also introduced to the Mark 5 system of automatic coding for TREAC; assembly, interpretive, and conversion programs for PEGASUS; and application of formula translation to the automatic coding of ordinary differential equations. The final chapter describes a machine designed for the manufacture of accurate models for wind tunnel tests. This monograph will be of interest to computer programmers, computer manufacturers, computer users, and university students.

Autoren/Hrsg.

Goodman, Richard

Inhaltsverzeichnis

1;Front Cover;1
2;Annual Review in Automatic Programming;4
3;Copyright Page;5
4;Table of Contents;8
5;Preface;10
6;Opening Address;14
7;Chapter 1. Future Trends in Automatic Programming;21
7.1;THE ENVIRONMENT OF A COMPUTER;21
7.2;MACHINE-LANGUAGES AND AUTOMATIC CODES;22
7.3;FEATURES OF PRESENT AUTOMATIC PROGRAMMING LANGUAGES;23
7.4;ADVANTAGES AND DISADVANTAGES OF PRESENT AUTOMATIC PROGRAMMING LANGUAGES;24
7.5;THE FUTURE OF AUTOMATIC PROGRAMMING;25
7.6;THE PROBLEMS OF INVENTING LANGUAGES FOR AUTOMATIC PROGRAMMING;27
8;Chapter 2. Some Problems of a Universal Autocode;29
8.1;INTRODUCTION;29
8.2;ASSEMBLY LANGUAGES;30
8.3;AUTOCODES;30
8.4;A UNIVERSAL AUTOCODE;30
8.5;DESIGN OF A UNIVERSAL AUTOCODE;31
8.6;THE PUBLICATION LANGUAGE;32
8.7;THE AUTOCODES;32
8.8;BUSINESS AUTOCODES;33
8.9;CONCLUSION;34
8.10;REFERENCES;35
9;Chapter 3. The Mark 5 System of Automatic Coding for TREAC;36
9.1;INTRODUCTION;36
9.2;TREAC FROM THE PROGRAMMERS' ANGLE;37
9.3;MARK 5 AUTOCODE—GRAMMAR;38
9.4;ALGEBRA;40
9.5;VERBS;40
9.6;A COMPLETE EXAMPLE;43
9.7;REFERENCE;44
10;Chapter 4. Assembly, Interpretive and Conversion Programs for PEGASUS;45
10.1;THE FERRANTI PEGASUS COMPUTER;45
10.2;THE PEGASUS INITIAL ORDERS;47
10.3;THE DOUBLE-LENGTH FLOATING-POINT INTERPRETIVE SCHEME (R650);50
10.4;THE COMPLEX NUMBER SCHEME (R630);51
10.5;MATRIX INTERPRETIVE SCHEMES;52
10.6;THE PEGASUS AUTOCODE;58
10.7;ACKNOWLEDGMENTS;70
10.8;REFERENCES;70
11;Chapter 5. Operational Experience with the PEGASUS Autocode;71
11.1;INTRODUCTION;71
11.2;EXPERIENCES OF THE USE OF AUTOCODE;72
11.3;GENERAL COMMENTS;75
11.4;COMMERCIAL APPLICATIONS;76
12;Chapter 6. PEGASUS: An Example of an Autocoded Program for Sales Analysis and Forecasting;77
12.1;INTRODUCTION;77
12.2;THE REQUIREMENT;78
12.3;THE DATA;79
12.4;THE PROCESSING STEPS;80
12.5;THE AUTOCODE;80
12.6;THE PROGRAM;80
12.7;THE RESULTS;81
12.8;COMMENT;81
12.9;TIMING;82
12.10;CONCLUSIONS;82
12.11;APPENDIX A;83
12.12;APPENDIX B NOTES ON READING THE PEGASUS AUTOCODE;84
12.13;APPENDIX G AUTOGODED COMPUTER PROGRAM;87
12.14;APPENDIX D INVOICE DATA;90
12.15;APPENDIX E BROUGHT FORWARD DATA;91
12.16;APPENDIX F RESULTS;92
13;Chapter 7. The Application of Formula Translation to the Automatic Coding of Ordinary Differential Equations;94
13.1;INTRODUCTION;94
13.2;EXPLICIT FORMULAE;95
13.3;IMPLICIT FORMULAE;96
13.4;SYSTEMS OF IMPLICIT EQUATIONS;98
13.5;THE THREE-ADDRESS CODING OF DIFFERENTIAL EQUATIONS;99
13.6;CONCLUSIONS;102
13.7;APPENDIX;103
14;Chapter 8. MERCURY Autocode: Principles of the Program Library;106
14.1;INTRODUCTION;106
14.2;THE AUTOCODE LANGUAGE;106
14.3;ACKNOWLEDGEMENTS;123
14.4;REFERENCES;123
15;Chapter 9. Automatic Programming on DEUCE;124
15.1;INTRODUCTION;124
15.2;NORMAL DEUCE PROGRAMMING;124
15.3;AUTOMATIC PROGRAMMING;125
15.4;STAC;126
15.5;INTERPRETIVE SCHEMES;128
15.6;TABULAR INTERPRETIVE PROGRAM (T.I.P.);130
15.7;THE GENERAL INTERPRETIVE PROGRAM (G.I.P.);134
15.8;APPENDIX;139
16;Chapter 10. Further DEUCE Interpretative Programs and some Translating Programs;140
16.1;INTRODUCTION;140
16.2;GEORGE, THE 'GENERAL ORDER GENERATOR';142
16.3;ALPHACODE;144
16.4;STEVE;146
16.5;EASICODE;147
16.6;AN EXISTING TRANSLATING PROGRAM;149
16.7;SOME TRANSLATION DIFFICULTIES;151
16.8;ACKNOWLEDGEMENTS;152
16.9;REFERENCES;152
16.10;APPENDIX 1;153
16.11;APPENDIX 2;154
16.12;APPENDIX 3;154
16.13;APPENDIX 4;157
17;Chapter 11. The STANTEC-ZEBRA Simple Code and its Interpretation;159
17.1;INTRODUCTORY;159
17.2;THE 'SIMPLE CODE' DESCRIBED;159
17.3;SIMPLE CODE IN THE REAL ZEBRA;176
17.4;APPENDIX STANTEC-ZEBRA SIMPLE CODE INSTRUCTION CODE;178
18;Chapter 12. The Share Operating System for the IBM 709;182
18.1;THE IBM 709;182
18.2;THE SHARE ORGANIZATION;182
18.3;SCOPE OF SHARE OPERATING SYSTEM;183
18.4;SAP FOR THE 704;183
18.5;SHARE COMPILER–ASSEMBLER–TRANSLATOR;185
18.6;THE INPUT–OUTPUT SYSTEM;187
18.7;THE DEBUGGING SYSTEM;188
18.8;THE SUPERVISORY CONTROL PROGRAM;189
19;Chapter 13. The Philosophy of Programming;191
19.1;THEME;191
19.2;ANDANTE CON MOTO;192
19.3;ALLEGRO;193
19.4;ALLEGRO MA NON TROPPO;194
19.5;CODA;199
20;Chapter 14. Automatic Programming and Business Applications;202
20.1;INTRODUCTORY;202
20.2;BUSINESS APPLICATIONS;203
20.3;PROGRAMMING;203
20.4;AUTOMATIC PROGRAMMING;205
20.5;SOME POCKETS OF WORK;206
20.6;CONCLUSION;208
21;Chapter 15. The FLOW-MATIC and MATH-MATIC Automatic Programming Systems;209
21.1;INTRODUCTION;209
21.2;FLOW-MATIC;209
21.3;MATH-MATIC;210
21.4;AUTOPROGRAMMING AND THE USER;211
21.5;CHANGE OF ATMOSPHERE;213
21.6;OBJECTIONS;213
21.7;'EDUCATION' PROPERTY OF COMPILED PROGRAMS;215
21.8;CONCLUSION;215
21.9;APPENDIX 1;216
21.10;APPENDIX 2;218
22;Chapter 16. TIDE: a Commercial Compiler for the IBM 650;220
22.1;INTRODUCTION;220
22.2;THE NEED FOR A COMPILER;220
22.3;STARTING POINT;221
22.4;DEVELOPMENT OF THE NEW LANGUAGE;223
22.5;SIMPLIFYING INSTRUCTION MODIFICATION;224
22.6;EXPERIENCE;225
22.7;CONCLUSIONS;225
22.8;APPENDIX 1;227
22.9;APPENDIX 2. STANDARD COST ROUTINE—BLOCK DIAGRAM;230
22.10;APPENDIX 3. STANDARD COST ROUTINE;232
22.11;APPENDIX 4. STANDARD COST TABLE;233
22.12;APPENDIX 5. STANDARD COST ROUTINE;233
23;Chapter 17. Auto-Programming for Numerically Controlled Machine Tools;235
23.1;INTRODUCTION;235
23.2;THE MILLING MACHINE;235
23.3;THE COMPUTING PROBLEM;238
23.4;STANDARD SPECIFICATION OF CURVES;238
23.5;INTERSECTION OF CURVES;240
23.6;PUNCHING;241
23.7;INTERSECTION ROUTINE;243
23.8;CONCLUSION;244
23.9;ACKNOWLEDGEMENT;244
24;Appendix One (A): On Computable Numbers, with an Application to the Entscheidungsproblem;245
24.1;1. COMPUTING MACHINES;246
24.2;2. DEFINITIONS;247
24.3;3. EXAMPLES OF COMPUTING MACHINES;248
24.4;4. ABBREVIATED TABLES;250
24.5;5. ENUMERATION OF COMPUTABLE SEQUENCES;254
24.6;6. THE UNIVERSAL COMPUTING MACHINE;256
24.7;7. DETAILED DESCRIPTION OF THE UNIVERSAL MACHINE;257
24.8;8. APPLICATION OF THE DIAGONAL PROCESS;260
24.9;9. THE EXTENT OF THE COMPUTABLE NUMBERS;263
24.10;10. EXAMPLES OF LARGE CLASSES OF NUMBERS WHICH ARE COMPUTABLE;268
24.11;11. APPLICATION TO THE ENTSCHEIDUNGSPROBLEM;273
24.12;APPENDIX: COMPUTABILITY AND EFFECTIVE CALCULABILITY;277
25;Appendix One (B): On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction;280
26;Appendix Two: Preliminary Report of ACM-GAMM Committee on an International Algebraic Language;283
26.1;PART I—INTRODUCTION;284
26.2;PART II—DESCRIPTION OF THE REFERENCE LANGUAGE;286
26.3;PART IIIa—BASIC SYMBOLS (a);302
26.4;PART Illb—SYNTACTIC SKELETON;303
26.5;PART IIIc—PUBLICATION LANGUAGE;304
27;Appendix Three: Automatic Programming— A Short Bibliography;306
28;Appendix Four: List of Participants;310