Systems Manual for 704 and 709 Fortran

Total Page:16

File Type:pdf, Size:1020Kb

Systems Manual for 704 and 709 Fortran April, 1960 SYSTEMS MANUAL FOR 704 FORTRAN AND 709 FORTRAN Applied Programming Department International Business Machines Cor poratior 590 Madison Avenue New York 22, New York TABLE OF CONTENTS PREFATORY NOTE CHAPTER I m INTRODUCTION I1 .I SECTION ONE III - SECTION ONE-PRIME IV - $ECTION ONE - DOUBLE -PRIME v ., SECTION TWO .I SECTION THREE - SECT,ION FOUR .I SECTION FIVE . SECTIONS FIVE-PRIME AND PRE-SIX . SECTION SIX a LIBRARIAN AND LIBRARY L MONITOR T GENERAL DIAGNOSTIC - EDITORS (FORTRAN AND DIAGNOSTIC) . APPENDIX I rn FORTRAN TAPE STATUS AT END OF SECTION PREFATORY NOTE This manual is an attempt to fulfill a long standing, much-pressed request. That is, a request for an over-all, comprehensive explan- ation of the workings of the entire Fortran System. This includes, in addition to the compiler proper, the monitor, the editor programs, and other corollary routines. It should be noted at the outset, however, that there are a number of difficulties involved in such a presentation. We want to take note of them immediately $0 that you can better apprec- iate the form and organization of the manual that follows. First and foremost, Fortran is a vaat, comprehensive system. This, alone, provides its own 4ifficulties. It means that any description of its workings can not be subsumed under the directional efforts of a single individual who understands it all. One individual could not know all the details and subtleties comprising the insides of all the sections marked off by the fourteen Roman numerals of this manual. We have chosen to make the attempt to bring you many of the fine points of the system; this is done by having the "expert" on each of the sections do the writing for that section. The price that must be paid for this approach is obvious : a single style of presentation and a aingly oriented organization cannot easily be obtained. A certain lack of uniformity of the level of generalization used in the various descriptions results. We trust this will be understood. In some cases this lack of uniformity results from the nature of the subject matter; in others, it results from the difficultv described. we attemot to minimize this difficulty by having an introduction which discusses the main points of each of the sections on approximately the same level, and, in the case of section two of the compiler, having a general level discussion then a de- tailed description. Certain redundancies, of course, must result. We do not apologize for these redundancies; rather, we suspect you will find them of value. As a matter of fact, in a manual of this kind, repetition will prove useful, especially since each added treatment of a subject matter will present it from a unique viewpoint. What we do apologize for here is not having more full cross-referencing. The descriptions are kept on a general level. We deliberately have avoided making references to machine and tape locations. This is in line with our regarding this treatment as an explanation of the system from a logical standpoint. In otherwords, we are presenting what is permanent -- or relatively permanent -- ignoring those things which are subject to moment- ary change, such as absolute core locations. Futhermore, reference can be made to the listings, of course, for supplementation along this line. A further advantage of this is that it means we can, in general, give simultaneous treatment to the 704 and 709 Fortran systems. With re- spect to this, however, it should be noted that we orientate our discussion primarily to the 709 system, making reference to the manner in which the 704 crystem differs. We wish to remind you, at this point, that the Fortran reference and operations manuals, particularly the latter, comprise useful supplements to the present discussion. In addition, an excellent paper on the compiler is included in the Proceedings of the Western Joint Computer Conference in Los Angeles, California, of February 1957. CTION 1. The primitive elements of the Fortran system are the master tape and appropriate editor deck. With these two a system tape is made. This is then used in the operation of the system. 2. In both 704 Fortran and 709 Fortran the system tape consists of four files. In 704 Fortran, the first two files are compiler files. In 709 Fortran, the first file is the monitor file and the second is the compiler file. In both the systems the third file is the library subroutine file and the fourth is the diagnostic file. When 709 Fortran is not being used in the monitor mode (i. e., a single compile only is occurring) the first re- cord only of the first file is used. This is the Card-Tape Simulator. 3. The system tape, itself, is manipulated by the tape record caller routine, 1-CS. This sits in lower core all during compilation and calls in the succeeding record from the system tape. The compiler records are always called in in sequence. Once a system record has been called and execute d, it is not called again. ' It should be noted that in 704 Fortran some of the records of the first file, comprising the compiler, are not executed until after the records of the second file, These are the records comprising the second pass of the section 6 assembly program. Records of the compiler may be called in singly or in a string, consisting of two or three records. Each record has a control word telling whether control, after the record is read in, is to go back to 1-CS or to the executive program record itself. If control goes to 1-CS, it means that another record in the string is to be read from the system tape and execution recommences. This control word, incidentally, is contained in the information of the Master Record Card, corresponding to it, in the Editor Deck (see XN). 4. What follows is a brief over all survey of the Fortran compiler proper. It will attempt to serve as the coordinating unit for the separate detailed write-ups, covering each of the sections of Fortran, which follow. As mentioned in the prefatory note, the material will necessarily cross-cut some of the material of the specific write-ups; it will, however, in most cases, be at a different level of generality. a. The six sections. As is now fairly well known, Fortran falls naturally into six main divisions, which we call sections. These sections are always executed sequentially. There is never a return to one section once it has been relinquiehed to go on to its successor. In addition to the six primary sections, there are four secondary sections. These should, however, be considered as nothing more than appendages to the primary sections. These are sections l', l", 5', and pre-6. Fortran may conceptually be considered as falling into two divisions: the first, comprised by sections 1, 2, and 3; and the second, by sections 4, 5, and 6. This is because at the end of section 3, the entire object program is essentially compiled. It is, in fact, compiled except for the fact that it exists in the C. L T. format and that it has symbolic tags (reference to index registers) instead of absolute tags. It is then the job of the remaining three sections to remedy these two features. Sections 4 and 5 handle the task of inserting the absolute tag references for the symbolic tag references. This, of course, includes the obligation to insert the necessary loading and saving index register instructions. Section 6, then, places the instructions in the C. L T. format into the proper r elocatable binary format. As for the first three sections, it may be considered that the first two of these do the entire task of source program analysis. This task includes performing most of the instruction (C. I. T. ) compil- ation. With reference to some of the instructions, however, sec- tions 1 and 2 simply compile information, in tabular form, to pass on to section 3, which uses these as the key to insert the proper in- structions. Because the analyses of sections 1 and 2 are independent, the C. I. Tts compiled are kept in separate files, which must sub- sequently be merged. Section 3, therefore, has the task of perform- ing this merge as well as the second merge implied by the instruct- ion file which it, itself, creates. Both section 3 and the last part of section 5, because of their position at the end of necessary primary analyses, perform certain optimizing tasks consisting mostly of re- moving or inserting certain instructions. It is well to note that the Fortran compiler makes extensive use of tables. These may be considered as of two types: those which are made up directly from the source program statements, and those which result from further analysis. It is the former class of tables which are mostly included in the reference manual list of tables and their size limitations. The latter class do, in some cases, impose further size limitations. Most tables are passed on from one section to another; some, however, are created purely for use within a section. The source program statements, once scanned, are placed in tabular form and the source program rrtatementa are not referred to again, With one exception, Fortran may be considered as a one pass system. That is, it looks at the source program only once, and it makes a scan of each statement once only. From then on, references are to tables only. The exception noted is in section 1 of the 709 systems.
Recommended publications
  • Efficient Computation of LALR(1) Look-Ahead Sets
    Efficient Computation of LALR(1) Look-Ahead Sets FRANK DeREMER and THOMAS PENNELLO University of California, Santa Cruz, and MetaWare TM Incorporated Two relations that capture the essential structure of the problem of computing LALR(1) look-ahead sets are defined, and an efficient algorithm is presented to compute the sets in time linear in the size of the relations. In particular, for a PASCAL grammar, the algorithm performs fewer than 15 percent of the set unions performed by the popular compiler-compiler YACC. When a grammar is not LALR(1), the relations, represented explicitly, provide for printing user- oriented error messages that specifically indicate how the look-ahead problem arose. In addition, certain loops in the digraphs induced by these relations indicate that the grammar is not LR(k) for any k. Finally, an oft-discovered and used but incorrect look-ahead set algorithm is similarly based on two other relations defined for the fwst time here. The formal presentation of this algorithm should help prevent its rediscovery. Categories and Subject Descriptors: D.3.1 [Programming Languages]: Formal Definitions and Theory--syntax; D.3.4 [Programming Languages]: Processors--translator writing systems and compiler generators; F.4.2 [Mathematical Logic and Formal Languages]: Grammars and Other Rewriting Systems--parsing General Terms: Algorithms, Languages, Theory Additional Key Words and Phrases: Context-free grammar, Backus-Naur form, strongly connected component, LALR(1), LR(k), grammar debugging, 1. INTRODUCTION Since the invention of LALR(1) grammars by DeRemer [9], LALR grammar analysis and parsing techniques have been popular as a component of translator writing systems and compiler-compilers.
    [Show full text]
  • SAKI: a Fortran Program for Generalized Linear Inversion of Gravity and Magnetic Profiles
    UNITED STATES DEPARTMENT OF THE INTERIOR GEOLOGICAL SURVEY SAKI: A Fortran program for generalized linear Inversion of gravity and magnetic profiles by Michael Webring Open File Report 85-122 1985 This report is preliminary and has not been reviewed for conformity with U.S. Geological Survey editorial standards. Table of Contents Abstract ------------------------------ 1 Introduction ---------------------------- 1 Theory ------------------------------- 2 Users Guide ---------------------------- 7 Model File -------------------------- 7 Observed Data Files ---------------------- 9 Command File ------------------------- 10 Data File Parameters ------------------- 10 Magnetic Parameters ------------------- 10 General Parameters -------------------- H Plotting Parameters ------------------- n Annotation Parameters ------------------ 12 Program Interactive Commands ----------------- 13 Inversion Function ---------------------- 16 Examples ------------------------------ 20 References ----------------------------- 26 Appendix A - plot system description ---------------- 27 Appendix B - program listing -------------------- 30 Abstract A gravity and magnetic inversion program is presented which models a structural cross-section as an ensemble of 2-d prisms formed by linking vertices into a network that may be deformed by a modified Marquardt algorithm. The nonuniqueness of this general model is constrained by the user in an interactive mode. Introduction This program fits in a least-squares sense the theoretical gravity and magnetic response of
    [Show full text]
  • Michigan Terminal System (MTS) Distribution 3.0 Documentation
    D3.NOTES 1 M T S D I S T R I B U T I O N 3.0 August 1973 General Notes Distribution 3.0 consists of 6 tapes for the 1600 bpi copy or 9 tapes for the 800 bpi copy. All tapes are unlabeled to save space. The last tape of each set is a dump/restore tape, designed to be used to get started (for new installations) or for conversion (for old installations). Instructions for these procedures are given in items 1001 and 1002 of the documentation list (later in this writeup). The remaining tapes are "Distribution Utility" tapes containing source, object, command, data, and print files, designed to be read by *FS or by the Distribution program, which is a superset of *FS. A writeup for this distribution version of *FS is enclosed (item 1003). Throughout the documentation for this distribution, reference is made to the components of the distribution. Generally these references are made by the 3-digit component number, sometimes followed by a slash and a 1- or 2-digit sub- component number. For example, the G assembler (*ASMG) has been assigned component number 066. However, the assembler actually has many "pieces" and so the assembler consists of components 066/1 through 066/60. Component numbers 001 through 481 are compatible with the numbers used in distribution 2.0; numbers above 481 are new components, or in some cases, old components which have been grouped under a new number. Two versions of the distribution driver file are provided: 461/11 for the 1600 bpi tapes, and 461/16 for the 800 bpi tapes.
    [Show full text]
  • Pearl: Diagrams for Composing Compilers
    Pearl: Diagrams for Composing Compilers John Wickerson Imperial College London, UK [email protected] Paul Brunet University College London, UK [email protected] Abstract T-diagrams (or ‘tombstone diagrams’) are widely used in teaching for explaining how compilers and interpreters can be composed together to build and execute software. In this Pearl, we revisit these diagrams, and show how they can be redesigned for better readability. We demonstrate how they can be applied to explain compiler concepts including bootstrapping and cross-compilation. We provide a formal semantics for our redesigned diagrams, based on binary trees. Finally, we suggest how our diagrams could be used to analyse the performance of a compilation system. 2012 ACM Subject Classification Software and its engineering → Compilers Keywords and phrases compiler networks, graphical languages, pedagogy Digital Object Identifier 10.4230/LIPIcs.ECOOP.2020.1 1 Introduction In introductory courses on compilers across the globe, students are taught about the inter- actions between compilers using ‘tombstone diagrams’ or ‘T-diagrams’. In this formalism, a compiler is represented as a ‘T-piece’. A T-piece, as shown in Fig. 1, is characterised by three labels: the source language of the compiler, the target language of the compiler, and the language in which the compiler is implemented. Complex networks of compilers can be represented by composing these basic pieces in two ways. Horizontal composition means that the output of the first compiler is fed in as the input to the second. Diagonal composition means that the first compiler is itself compiled using the second compiler.
    [Show full text]
  • MTS on Wikipedia Snapshot Taken 9 January 2011
    MTS on Wikipedia Snapshot taken 9 January 2011 PDF generated using the open source mwlib toolkit. See http://code.pediapress.com/ for more information. PDF generated at: Sun, 09 Jan 2011 13:08:01 UTC Contents Articles Michigan Terminal System 1 MTS system architecture 17 IBM System/360 Model 67 40 MAD programming language 46 UBC PLUS 55 Micro DBMS 57 Bruce Arden 58 Bernard Galler 59 TSS/360 60 References Article Sources and Contributors 64 Image Sources, Licenses and Contributors 65 Article Licenses License 66 Michigan Terminal System 1 Michigan Terminal System The MTS welcome screen as seen through a 3270 terminal emulator. Company / developer University of Michigan and 7 other universities in the U.S., Canada, and the UK Programmed in various languages, mostly 360/370 Assembler Working state Historic Initial release 1967 Latest stable release 6.0 / 1988 (final) Available language(s) English Available programming Assembler, FORTRAN, PL/I, PLUS, ALGOL W, Pascal, C, LISP, SNOBOL4, COBOL, PL360, languages(s) MAD/I, GOM (Good Old Mad), APL, and many more Supported platforms IBM S/360-67, IBM S/370 and successors History of IBM mainframe operating systems On early mainframe computers: • GM OS & GM-NAA I/O 1955 • BESYS 1957 • UMES 1958 • SOS 1959 • IBSYS 1960 • CTSS 1961 On S/360 and successors: • BOS/360 1965 • TOS/360 1965 • TSS/360 1967 • MTS 1967 • ORVYL 1967 • MUSIC 1972 • MUSIC/SP 1985 • DOS/360 and successors 1966 • DOS/VS 1972 • DOS/VSE 1980s • VSE/SP late 1980s • VSE/ESA 1991 • z/VSE 2005 Michigan Terminal System 2 • OS/360 and successors
    [Show full text]
  • Die Gruncllehren Cler Mathematischen Wissenschaften
    Die Gruncllehren cler mathematischen Wissenschaften in Einzeldarstellungen mit besonderer Beriicksichtigung der Anwendungsgebiete Band 135 Herausgegeben von J. L. Doob . E. Heinz· F. Hirzebruch . E. Hopf . H. Hopf W. Maak . S. Mac Lane • W. Magnus. D. Mumford M. M. Postnikov . F. K. Schmidt· D. S. Scott· K. Stein Geschiiftsfiihrende Herausgeber B. Eckmann und B. L. van der Waerden Handbook for Automatic Computation Edited by F. L. Bauer· A. S. Householder· F. W. J. Olver H. Rutishauser . K. Samelson· E. Stiefel Volume I . Part a Heinz Rutishauser Description of ALGOL 60 Springer-Verlag New York Inc. 1967 Prof. Dr. H. Rutishauser Eidgenossische Technische Hochschule Zurich Geschaftsfuhrende Herausgeber: Prof. Dr. B. Eckmann Eidgenossische Tecbnische Hocbscbule Zurich Prof. Dr. B. L. van der Waerden Matbematisches Institut der Universitat ZUrich Aile Rechte, insbesondere das der Obersetzung in fremde Spracben, vorbebalten Ohne ausdriickliche Genehmigung des Verlages ist es auch nicht gestattet, dieses Buch oder Teile daraus auf photomechaniscbem Wege (Photokopie, Mikrokopie) oder auf andere Art zu vervielfaltigen ISBN-13: 978-3-642-86936-5 e-ISBN-13: 978-3-642-86934-1 DOl: 10.1007/978-3-642-86934-1 © by Springer-Verlag Berlin· Heidelberg 1967 Softcover reprint of the hardcover 1st edition 1%7 Library of Congress Catalog Card Number 67-13537 Titel-Nr. 5l1B Preface Automatic computing has undergone drastic changes since the pioneering days of the early Fifties, one of the most obvious being that today the majority of computer programs are no longer written in machine code but in some programming language like FORTRAN or ALGOL. However, as desirable as the time-saving achieved in this way may be, still a high proportion of the preparatory work must be attributed to activities such as error estimates, stability investigations and the like, and for these no programming aid whatsoever can be of help.
    [Show full text]
  • 19710010121.Pdf
    General Disclaimer One or more of the Following Statements may affect this Document This document has been reproduced from the best copy furnished by the organizational source. It is being released in the interest of making available as much information as possible. This document may contain data, which exceeds the sheet parameters. It was furnished in this condition by the organizational source and is the best copy available. This document may contain tone-on-tone or color graphs, charts and/or pictures, which have been reproduced in black and white. This document is paginated as submitted by the original source. Portions of this document are not fully legible due to the historical nature of some of the material. However, it is the best reproduction available from the original submission. Produced by the NASA Center for Aerospace Information (CASI) ^i A PROPOSFD TRANSLATOR-WRITING-SYSTEM LANGUAGE FRANKLIN L. DE RLMER CEP REPORT, VOLUME 3, No. 1 September 1970 C4 19 5 G °o ACCESSION NUPBER) (T U) c^`r :E 3 (PAG 5 (CODE) ^y1P`C{ o0 LL (NASA CR OR T X OR AD NUME ►_R) (CATEGORY) 0^0\G^^^ v Z The Computer Evolution Project Applied Sciences The University of California at Santa Cruz, California 95060 A PROPOSED TRANSLATOR-WRITING-SYSTEM LANGUAGE ABSTRACT We propose herein a language for an advanced translator writing system (TWS), a system for use by langwige designers, I d as opposed to compiler writers, which will accept as input a formal specification of a language and which will generate as output a translator for the specified language.
    [Show full text]
  • Translator Writing System
    A TRANSLATOR WRITING SYSTEM • FOR MINICOMPUTERS by Jake Madderom B.A.Sc, University of British Columbia, 1968 A THESIS SUBMITTED IN PARTIAL FULFILMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER OF APPLIED SCIENCE in the Department of Electrical Engineering We accept this thesis as conforming to the required standard THE UNIVERSITY OF BRITISH COLUMBIA June 1973 In presenting this thesis in partial fulfilment of the requirements for an advanced degree at the University of British Columbia, I agree that the Library shall make it freely available for reference and study. I further agree that permission for extensive copying of this thesis for scholarly purposes may be granted by the Head of my Department or by his representatives. It is understood that copying or publication of this thesis for financial gain shall not be allowed without my written permission. Department of £ C* ' r\ ^ <£. r~ , .i The University of British Columbia Vancouver 8, Canada ABSTRACT Some portions of real-time computer process control software can be programmed with special purpose high-level languages. A trans• lator writing'system for minicomputers is developed to aid in writing translators for those languages. The translator writing system uses an LR(1) grammar analyzer with an LR(1) skeleton parser. XPL is used as the source language for the semantics. An XPL to intermediate language translator has been written to aid in the translation of XPL programs to minicomputer assembly language. A simple macro generator must be written to translate intermediate language programs into various minicomputer assembly languages. i TABLE OF CONTENTS Page ABSTRACT i TABLE OF CONTENTS • ii LIST OF ILLUSTRATIONS iii GLOSSARY iv ACKNOWLEDGEMENT vii 1.
    [Show full text]
  • The Copyright Law of the United States (Title 17, U.S
    NOTICE WARNING CONCERNING COPYRIGHT RESTRICTIONS: The copyright law of the United States (title 17, U.S. Code) governs the making of photocopies or other reproductions of copyrighted material. Any copying of this document without permission of its author may be prohibited by law. CMU-CS-84-163 An Efficient All-paths Parsing Algorithm for Natural Languages Masaru Tornita Computer Science Department Carnegie-Mellon University Pittsburgh, PA 15213 25 October 1984 Abstract An extended LR parsing algorithm is introduced and its application to natural language processing is discussed. Unlike the standard LR, our algorithm is capable of handling arbitrary context-free phrase structure grammars including ambiguous grammars, while most of the LR parsing efficiency is preserved. When an input sentence is ambiguous, it produces all possible parses in an efficient manner with the idea of a "graph-structured stack." Comparisons with other parsing methods are made. This research was sponsored by the Defense Advanced Research Projects Agency (DOD), ARPA Order No. 3597, monitored by the Air Force Avionics Laboratory Under Contract F33615-81 -K-1539. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Defense Advanced Research Projects Agency or the US Government. i Table of Contents 1. Introduction 1 2. LR parsing 3 2.1. An example 3 2.2. Problem in Applying to Natural Languages 5 3. MLR parsing 7 3.1. With Stack List 7 3.2. With a Tree-structured Stack 9 3.3. With a Graph-structured Stack 10 4.
    [Show full text]
  • ESP: a Language for Programmable Devices
    ESP: A Language for Programmable Devices Sanjeev Kumar, Yitzhak Mandelbaum, Xiang Yu, and Kai Li Princeton University (sku mar,yitz hakm ,xyu, li) @ cs. princeton, edu ABSTRACT cards was implemented using event-driven state machines in This paper presents the design and implementation of Event- C. Our experience was that while good perfbrmance could driven State-machines Programming (ESP)--a language for be achieved with this approach, the source code was hard to programmable devices. In traditional languages, like C, us- maintain and debug. The implementation involved around ing event-driven state-machines forces a tradeoff that re- 15600 lines of C code. Even after several years of debugging, quires giving up ease of development and reliability to achieve race conditions cause the system to crash occasionally. IJlg}l p~,ti~rlnallc~, ESP is designed to provide all of these ESP was designed to meet the following goals, First, the three properties simult.aneously. language should provide constructs to write concise modu- ESP provides a comprehensive set of teatures to support lar programs. Second, the language should permit the use development of compact and modular programs. The ESP of software verification tools like SPIN [14] so that the con- compiler compiles the programs into two targets---a C file current programs can be tested thoroughly. Finally, the lan- that can be used to generate efficient firmware for the device; guage should permit aggressive compile time optimizations and a specification that can be used by a verifier like SPIN to provide low overhead. to extensively test the firmware. ESP has a number of language features that allow devel- As a case study, we reimplemented VMMC firmware that opment of fast and reliable concurrent programs.
    [Show full text]
  • XPL: a Language for Modular Homogeneous Language Embedding
    XPL: A Language for Modular Homogeneous Language Embedding Tony Clark Department of Computer Science, Middlesex University, London NW4 4BT, UK Abstract Languages that are used for Software Language Engineering (SLE) offer a range of fea- tures that support the construction and deployment of new languages. SLE languages offer features for constructing and processing syntax and defining the semantics of lan- guage features. New languages may be embedded within an existing language (internal) or may be stand-alone (external). Modularity is a desirable SLE property for which there is no generally agreed approach. This article analyses the current tools for SLE and identifies the key features that are common. It then proposes a language called XPL that supports these features. XPL is higher-order and allows languages to be constructed and manipulated as first-class elements and therefore can be used to represent a range of approaches to modular language definition. This is validated by using XPL to define the notion of a language module that supports modular language construction and language transformation. Keywords: domain specific languages, software language engineering, language modules 1. Modular Software Language Engineering 1.1. Background There is increasing interest in Software Language Engineering (SLE) where new lan- guages are defined as part of the system engineering process. In particular Domain Specific Language (DSL) Engineering [1, 2] is an approach whereby a new language is defined or an existing language is extended; in both cases DSLs involve constructing abstractions that directly support the elements of a single problem domain. This is to be contrasted with General Purpose Languages (GPLs) that have features that can be used to represent elements from multiple problem domains.
    [Show full text]
  • C:\Users\Luanne\Documents\SISIG
    GKILDALL.WS4 ------------ List of Gary Kildall texts compiled by Emmanuel ROCHE. 1968 ---- - "Experiments in large-scale computer direct access storage manipulation" Thesis for Master of Science, University of Washington December 1968 (Thesis No.17341) (ROCHE> Retyped: GKMS.WS4) 1969 ---- - "Experiments in large-scale computer direct access storage manipulation" Technical Report No.69-01, Computer Science Group University of Washington, 1969 (ROCHE> Missing...) 1970 ---- - "APL\B5500: The language and its implementation" Technical Report No.70-09-04, Computer Science Group University of Washington, September 1970 (ROCHE> Retyped: GKAPL.WS4) - "The ALGOL-E Programming System" Internal Report, Mathematics Department, Naval Postgraduate School, Monterey, California December 1970 (ROCHE> Missing...) 1971 ---- - "A Heathkit method for building data management programs" Gary Kildall & Earl Hunt ACM SIGIR Information Storage and Retrieval Symposium 1971, pp.117-131 (ROCHE> Retyped: GKEH.WS4) 1972 ---- - "A code synthesis filter for basic block optimization" Technical Report No.72-01-01, Computer Science Group file:///C|/...20Histories%20Report%20to%20CHM/DRI/Emmanuel%20Roche%20documents%20conversion/Kildall.(zip)/GKILDALL.TXT[2/6/2012 10:28:06 AM] University of Washington January 1972 (ROCHE> Missing...) - "ALGOL-E: An experimental approach to the study of programming languages" Naval Postgraduate School, Monterey, California NPS Report NPS-53KG72 11A January 1972 (ROCHE> Missing...) - "ALGOL-E: An experimental approach to the study of programming
    [Show full text]