| ALGOL 60 | |
| Paradigms: | procedural, imperative, structured |
| Family: | ALGOL |
| Designers: | Backus, Bauer, Green, Katz, McCarthy, Naur, Perlis, Rutishauser, Samelson, van Wijngaarden, Vauquois, Wegstein, Woodger |
| Typing: | Static, strong |
| Scope: | Lexical |
| Influenced By: | ALGOL 58 |
| Influenced: | Most subsequent imperative languages (so-called ALGOL-like languages), e.g., PL/I, Simula, CPL, Pascal, Ada, C |
ALGOL 60 (short for Algorithmic Language 1960) is a member of the ALGOL family of computer programming languages. It followed on from ALGOL 58 which had introduced code blocks and the begin and end pairs for delimiting them, representing a key advance in the rise of structured programming. ALGOL 60 was one of the first languages implementing function definitions (that could be invoked recursively). ALGOL 60 function definitions could be nested within one another (which was first introduced by any programming language), with lexical scope. It gave rise to many other languages, including CPL, PL/I, Simula, BCPL, B, Pascal, and C. Practically every computer of the era had a systems programming language based on ALGOL 60 concepts.
Niklaus Wirth based his own ALGOL W on ALGOL 60 before moving to develop Pascal. Algol-W was intended to be the next generation ALGOL but the ALGOL 68 committee decided on a design that was more complex and advanced rather than a cleaned simplified ALGOL 60. The official ALGOL versions are named after the year they were first published. ALGOL 68 is substantially different from ALGOL 60 and was criticised partially for being so, so that in general "ALGOL" refers to dialects of ALGOL 60.
ALGOL 60 – with COBOL – were the first languages to seek standardization.
ALGOL 60 was used mostly by research computer scientists in the United States and in Europe. Its use in commercial applications was hindered by the absence of standard input/output facilities in its description and the lack of interest in the language by large computer vendors. ALGOL 60 did however become the standard for the publication of algorithms and had a profound effect on future language development.
John Backus developed the Backus normal form method of describing programming languages specifically for ALGOL 58. It was revised and expanded by Peter Naur for ALGOL 60, and at Donald Knuth's suggestion renamed Backus–Naur form.[1]
Peter Naur: "As editor of the ALGOL Bulletin I was drawn into the international discussions of the language and was selected to be member of the European language design group in November 1959. In this capacity I was the editor of the ALGOL 60 report, produced as the result of the ALGOL 60 meeting in Paris in January 1960."[2]
The following people attended the meeting in Paris (from January 11 to 16):
Alan Perlis gave a vivid description of the meeting: "The meetings were exhausting, interminable, and exhilarating. One became aggravated when one's good ideas were discarded along with the bad ones of others. Nevertheless, diligence persisted during the entire period. The chemistry of the 13 was excellent."
The language originally did not include recursion. It was inserted into the specification at the last minute, against the wishes of some of the committee.[3]
ALGOL 60 inspired many languages that followed it. Tony Hoare remarked: "Here is a language so far ahead of its time that it was not only an improvement on its predecessors but also on nearly all its successors."[4] [5]
To date there have been at least 70 augmentations, extensions, derivations and sublanguages of ALGOL 60.[6]
| Name | Year | Author | State | Description | Target CPU | |
|---|---|---|---|---|---|---|
| X1 ALGOL 60 | August 1960[7] | First implementation of ALGOL 60[8] | Electrologica X1 | |||
| Algol | 1960[9] | Edgar T. Irons | ALGOL 60 | |||
| Burroughs Algol (Several variants) | 1961 | Burroughs Corporation (with participation by Hoare, Dijkstra, and others) | Basis of the Burroughs (and now Unisys MCP based) computers | Burroughs Large Systems and midrange systems | ||
| 1961 | Simula was originally contracted as a simulation extension of the Case ALGOL | UNIVAC 1107 | ||||
| 1961 | For ODIN time-sharing system | PDP-1 | ||||
| 1961 | ALGOL 60 | DASK at Regnecentralen | ||||
| 1962 | ALGOL 60 | SMIL at Lund University | ||||
| 1962 | ALGOL 60 | GIER at Regnecentralen | ||||
| Dartmouth ALGOL 30[10] | 1962 | ALGOL 60 | LGP-30 | |||
| Alcor Mainz 2002 | 1962 | Ursula Hill-Samelson, Hans Langmaack | Siemens 2002 | |||
| ALCOR-Illinois 7090 | 1962 [11] [12] | Manfred Paul, Hans Rüdiger Wiehle, David Gries, and Rudolf Bayer |  United States, | ALGOL 60 Implemented at Illinois and the TH München, 1962-1964 | IBM 7090 | |
| 1962 | ||||||
| 1962 | Discussed in his 1980 Turing Award lecture | Elliott 803 & the Elliott 503 | ||||
| ALGOL 60 | 1962 | Roland Strobel[13] | Zeiss-Rechenautomat ZRA 1 | |||
| ALGOL 60 | 1962 | Bernard Vauquois, Louis Bolliet[14] |  France | Institut d'Informatique et Mathématiques Appliquées de Grenoble (IMAG) and Compagnie des Machines Bull | Bull Gamma 60 | |
| Algol Translator | 1962 | Staatsbedrijf der Posterijen, Telegrafie en Telefonie | ZEBRA | |||
| 1963 | English Electric Company KDF9 | |||||
| SCALP[15] | 1963 | Self-Contained ALgol Processor for a subset of ALGOL 60 | LGP-30 | |||
| 1963 | A test of the META II compiler compiler | |||||
| FP6000 Algol | 1963 | |||||
| 1964 | Brian Randell and Lawford John Russell | Atomic Power Division of English Electric Company. Precursor to Ferranti Pegasus, National Physical Laboratories ACE and English Electric DEUCE implementations | English Electric Company KDF9 | |||
| ALGOL 60 | 1964 | Jean-Claude Boussard[16] | IBM 7090 | |||
| ALGOL 60 | 1965 | [17] | Centre de calcul de la Faculté des Sciences de Nancy | IBM 1620 | ||
| Dartmouth ALGOL | 1965 | Stephen J. Garland, Sarr Blumson, Ron Martin | ALGOL 60 | Dartmouth Time Sharing System for the GE 235 | ||
| 1965 | UNIVAC | |||||
| ALGOL 60 | 1965[18] | F.E.J. Kruseman Aretz | MC compiler for the EL-X8 | Electrologica X8 | ||
| ALGEK | 1965 | АЛГЭК, based on ALGOL 60 and COBOL support, for economical tasks | ||||
| 1966 | publ. A. Viil, M Kotli & M. Rakhendi, | Minsk-22 | ||||
| 1967 | GAMS group (ГАМС, группа автоматизации программирования для машин среднего класса), cooperation of Comecon Academies of Science | Minsk-22, later ES EVM, BESM | ||||
| 1967 | Polish ZAM computer | |||||
| Chinese Algol | 1972 | Chinese characters, expressed via the Symbol system | ||||
| 1972 | DG Eclipse family of Computers | |||||
| NASE | 1990 | Erik Schoenfelder |  Germany | Interpreter | Linux and MS Windows | |
| MARST | 2000 | Andrew Makhorin | ALGOL 60 to C translator | All CPUs supported by the GNU Compiler Collection; MARST is part of the GNU project |
The Burroughs dialects included special system programming dialects such as ESPOL and NEWP.
ALGOL 60 as officially defined had no I/O facilities; implementations defined their own in ways that were rarely compatible with each other. In contrast, ALGOL 68 offered an extensive library of transput (ALGOL 68 parlance for input/output) facilities.
ALGOL 60 provided two evaluation strategies for parameter passing: the common call-by-value, and call-by-name. The procedure declaration specified, for each formal parameter, which was to be used: value specified for call-by-value, and omitted for call-by-name. Call-by-name has certain effects in contrast to call-by-reference. For example, without specifying the parameters as value or reference, it is impossible to develop a procedure that will swap the values of two parameters if the actual parameters that are passed in are an integer variable and an array that is indexed by that same integer variable.[19] Think of passing a pointer to swap(i, A[i]) in to a function. Now that every time swap is referenced, it's reevaluated. Say i := 1 and A[i] := 2, so every time swap is referenced it'll return the other combination of the values ([1,2], [2,1], [1,2] and so on). A similar situation occurs with a random function passed as actual argument.
Call-by-name is known by many compiler designers for the interesting "thunks" that are used to implement it. Donald Knuth devised the "man or boy test" to separate compilers that correctly implemented "recursion and non-local references." This test contains an example of call-by-name.
There are 35 such reserved words in the standard Burroughs Large Systems sub-language:
ALPHAARRAYBEGINBOOLEANCOMMENTCONTINUEDIRECTDODOUBLEELSEENDEVENTFALSEFILEFORFORMATGOIFINTEGERLABELLISTLONGOWNPOINTERPROCEDUREREALSTEPSWITCHTASKTHENTRUEUNTILVALUEWHILEZIPThere are 71 such restricted identifiers in the standard Burroughs Large Systems sub-language:
ACCEPTANDATTACHBYCALLCASECAUSECLOSEDEALLOCATEDEFINEDETACHDISABLEDISPLAYDIVDUMPENABLEEQLEQVEXCHANGEEXTERNALFILLFORWARDGEQGTRIMPININTERRUPTISLBLEQLIBERATELINELOCKLSSMERGEMODMONITORMUXNEQNONOTONOPENOROUTPICTUREPROCESSPROCUREPROGRAMDUMPRBREADRELEASEREPLACERESETRESIZEREWINDRUNSCANSEEKSETSKIPSORTSPACESWAPTHRUTIMESTOWAITWHENWITHWRITEand also the names of all the intrinsic functions.
| Priority | Operator | ||
|---|---|---|---|
| first arithmetic | first | ↑ (power) | |
| second | ×, / (real), ÷ (integer) | ||
| third | +, - | ||
| second | <, ≤, =, ≥, >, ≠ | ||
| third | ¬ (not) | ||
| fourth | ∧ (and) | ||
| fifth | ∨ (or) | ||
| sixth | ⊃ (implication) | ||
| seventh | ≡ (equivalence) | ||
procedure Absmax(a) Size:(n, m) Result:(y) Subscripts:(i, k); value n, m; array a; integer n, m, i, k; real y; comment The absolute greatest element of the matrix a, of size n by m, is copied to y, and the subscripts of this element to i and k; begin integer p, q; y := 0; i := k := 1; for p := 1 step 1 until n do for q := 1 step 1 until m do if abs(a[p, q]) > y then begin y := abs(a[p, q]); i := p; k := q end end Absmax
Implementations differ in how the text in bold must be written. The word 'INTEGER', including the quotation marks, must be used in some implementations in place of integer, above, thereby designating it as a special keyword.
Following is an example of how to produce a table using Elliott 803 ALGOL:[20]
FLOATING POINT ALGOL TEST' BEGIN REAL A,B,C,D' READ D' FOR A:= 0.0 STEP D UNTIL 6.3 DO BEGIN PRINT,££L??' B := SIN(A)' C := COS(A)' PRINT,,,A,B,C' END' END'
Since ALGOL 60 had no I/O facilities, there is no portable hello world program in ALGOL. The following program could (and still will) compile and run on an ALGOL implementation for a Unisys A-Series mainframe, and is a straightforward simplification of code taken from The Language Guide[21] at the University of Michigan-Dearborn Computer and InformationScience Department Hello world! ALGOL Example Program page.[22]
BEGIN FILE F(KIND=REMOTE); EBCDIC ARRAY E[0:11]; REPLACE E BY "HELLO WORLD!"; WRITE(F, *, E); END.
Where * etc. represented a format specification as used in FORTRAN, e.g.[23]
A simpler program using an inline format:An even simpler program using the Display statement:
An alternative example, using Elliott Algol I/O is as follows. Elliott Algol used different characters for "open-string-quote" and "close-string-quote", represented here by and .Here's a version for the Elliott 803 Algol (A104) The standard Elliott 803 used 5-hole paper tape and thus only had upper case. The code lacked any quote characters so £ (pound sign) was used for open quote and ? (question mark) for close quote. Special sequences were placed in double quotes (e.g., £L?? produced a new line on the teleprinter).
HIFOLKS' BEGIN PRINT £HELLO WORLD£L??' END'
The ICT 1900 series Algol I/O version allowed input from paper tape or punched card. Paper tape 'full' mode allowed lower case. Output was to a line printer. Note use of '(', ')', and %.[24] 'PROGRAM' (HELLO) 'BEGIN' 'COMMENT' OPEN QUOTE IS '(', CLOSE IS ')', PRINTABLE SPACE HAS TO BE WRITTEN AS % BECAUSE SPACES ARE IGNORED; WRITE TEXT('('HELLO%WORLD')'); 'END' 'FINISH'
LEAP is an extension to the ALGOL 60 programming language which provides an associative memory of triples. The three items in a triple denote the association that an Attribute of an Object has a specific Value. LEAP was created by Jerome Feldman (University of California Berkeley) and Paul Rovner (MIT Lincoln Lab) in 1967. LEAP was also implemented in SAIL.
de:Gerhard Goos
. Fakultät für Informatik, Karlsruhe Institute of Technology (KIT) . Karlsruhe, Germany . 2017-08-07 . 2022-11-14 . live . https://web.archive.org/web/20220519131116/http://www.kps2017.uni-jena.de/proceedings/kps2017_submission_1.pdf . 2022-05-19. (11 pages)