| ALGOL | |
| Logo Caption: | A 1965 manual for ALGOL-20 |
| Paradigm: | Procedural, imperative, structured |
| Family: | ALGOL |
| Designers: | Bauer, Bottenbruch, Rutishauser, Samelson, Backus, Katz, Perlis, Wegstein, Naur, Vauquois, van Wijngaarden, Woodger, Green, McCarthy |
| Typing: | Static, strong |
| Scope: | Lexical |
| Influenced: | Most subsequent imperative languages (including so-called ALGOL-like languages) e.g. PL/I, Simula, Pascal, C and Scheme |
ALGOL (; short for "Algorithmic Language")[1] is a family of imperative computer programming languages originally developed in 1958. ALGOL heavily influenced many other languages and was the standard method for algorithm description used by the Association for Computing Machinery (ACM) in textbooks and academic sources for more than thirty years.[2]
In the sense that the syntax of most modern languages is "Algol-like",[3] it was arguably more influential than three other high-level programming languages among which it was roughly contemporary: FORTRAN, Lisp, and COBOL.[4] It was designed to avoid some of the perceived problems with FORTRAN and eventually gave rise to many other programming languages, including PL/I, Simula, BCPL, B, Pascal, Ada, and C.
ALGOL introduced code blocks and the begin...end pairs for delimiting them. It was also the first language implementing nested function definitions with lexical scope. Moreover, it was the first programming language which gave detailed attention to formal language definition and through the Algol 60 Report introduced Backus–Naur form, a principal formal grammar notation for language design.
There were three major specifications, named after the years they were first published:
ALGOL 68 is substantially different from ALGOL 60 and was not well received, so reference to "Algol" is generally understood to mean ALGOL 60 and its dialects.
ALGOL was developed jointly by a committee of European and American computer scientists in a meeting in 1958 at the Swiss Federal Institute of Technology in Zurich (cf. ALGOL 58).[9] It specified three different syntaxes: a reference syntax, a publication syntax, and an implementation syntax, syntaxes that permitted it to use different keyword names and conventions for decimal points (commas vs periods) for different languages.
ALGOL was used mostly by research computer scientists in the United States and in Europe; commercial applications were hindered by the absence of standard input/output facilities in its description, and the lack of interest in the language by large computer vendors (other than Burroughs Corporation). 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.[10]
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."[11]
The following people attended the meeting in Paris (from 1 to 16 January):
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."January 2024.
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."[12] The Scheme programming language, a variant of Lisp that adopted the block structure and lexical scope of ALGOL, also adopted the wording "Revised Report on the Algorithmic Language Scheme" for its standards documents in homage to ALGOL.[13]
As Peter Landin noted, ALGOL was the first language to combine seamlessly imperative effects with the (call-by-name) lambda calculus. Perhaps the most elegant formulation of the language is due to John C. Reynolds, and it best exhibits its syntactic and semantic purity. Reynolds's idealized ALGOL also made a convincing methodologic argument regarding the suitability of local effects in the context of call-by-name languages, in contrast with the global effects used by call-by-value languages such as ML. The conceptual integrity of the language made it one of the main objects of semantic research, along with Programming Computable Functions (PCF) and ML.
To date there have been at least 70 augmentations, extensions, derivations and sublanguages of Algol 60.[14]
| Name | Year | Author | Country | Description | Target CPU | |
|---|---|---|---|---|---|---|
| ZMMD-implementation | 1958 | Friedrich L. Bauer, Heinz Rutishauser, Klaus Samelson, Hermann Bottenbruch | Z22 (later Zuse's Z23 was delivered with an Algol 60 compiler)[15] | |||
| X1 ALGOL 60 | 1960 August[16] | First implementation of ALGOL 60[17] | Electrologica X1 | |||
| 1960s | Subject of the 1980 Turing Award Lecture[18] | Elliott 803, Elliott 503, Elliott 4100 series | ||||
| 1960 | Various (see article) | |||||
| 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 their midrange also. | ||
| 1961 | Case Institute of Technology[19] | Simula was originally contracted as a simulation extension of the Case ALGOL | UNIVAC 1107 | |||
| 1961 | For ODIN time-sharing system[20] | PDP-1 | ||||
| 1961 | Implementation of full Algol 60 | DASK at Regnecentralen | ||||
| 1962 | Thomas Eugene Kurtz et al. | LGP-30 | ||||
| 1962 | ||||||
| ALGOL 60 | 1962 | Bernard Vauquois, Louis Bolliet[21] |  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 | |||||
| 1963 | A test of the META II compiler compiler | |||||
| 1964 | Brian Randell and L. J. 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 | |||
| 1965 | UNIVAC | |||||
| ALGEK | 1965 | АЛГЭК, based on ALGOL-60 and COBOL support, for economical tasks | Minsk-22 | |||
| 1966 | Proposed successor to ALGOL 60 | IBM System/360 | ||||
| 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 | |||||
| 1967 | Algol 60 with classes | UNIVAC 1107 | ||||
| 1967/1968 | [22] | |||||
| Chinese Algol | 1972 | Chinese characters, expressed via the Symbol system | ||||
| 1972 | DG Eclipse family of Computers | |||||
| 1979 | Addition of orthogonal datatypes with intended use as a teaching language | PDP-11 with a subsequent implementation on the Java VM |
The Burroughs dialects included special Bootstrapping dialects such as ESPOL and NEWP. The latter is still used for Unisys MCP system software.
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 (input/output) facilities.
ALGOL 60 allowed for two evaluation strategies for parameter passing: the common call-by-value, and 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.[23] Think of passing a pointer to swap(i, A[i]) in to a function. Now that every time swap is referenced, it is reevaluated. Say i := 1 and A[i] := 2, so every time swap is referenced it will 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.
ALGOL 68 was defined using a two-level grammar formalism invented by Adriaan van Wijngaarden and which bears his name. Van Wijngaarden grammars use a context-free grammar to generate an infinite set of productions that will recognize a particular ALGOL 68 program; notably, they are able to express the kind of requirements that in many other programming language standards are labelled "semantics" and have to be expressed in ambiguity-prone natural language prose, and then implemented in compilers as ad hoc code attached to the formal language parser.
(The way the bold text has to be written depends on the implementation, e.g. 'INTEGER'—quotation marks included—for integer. This is known as stropping.)
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
Here is an example of how to produce a table using Elliott 803 ALGOL.[24]
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 PUNCH(3),,,A,B,C' END END'
The following code samples are ALGOL 68 versions of the above ALGOL 60 code samples.
ALGOL 68 implementations used ALGOL 60's approaches to stropping. In ALGOL 68's case tokens with the bold typeface are reserved words, types (modes) or operators.
proc abs max = ([,]real a, ref real y, ref int i, k)real: comment The absolute greatest element of the matrix a, of size ⌈a by 2⌈a is transferred to y, and the subscripts of this element to i and k; comment begin real y := 0; i := ⌊a; k := 2⌊a; for p from ⌊a to ⌈a do for q from 2⌊a to 2⌈a do if abs a[p, q] > y then y := abs a[p, q]; i := p; k := q fi od od; y end # abs max #
Note: lower (⌊) and upper (⌈) bounds of an array, and array slicing, are directly available to the programmer.
floating point algol68 test: (real a,b,c,d; # printf – sends output to the file stand out. # # printf($p$); – selects a new page # printf(($pg$,"Enter d:")); read(d); for step from 0 while a:=step*d; a <= 2*pi do printf($l$); # $l$ - selects a new line. # b := sin(a); c := cos(a); printf(($z-d.6d$,a,b,c)) # formats output with 1 digit before and 6 after the decimal point. # od)
The variations and lack of portability of the programs from one implementation to another is easily demonstrated by the classic hello world program.
See main article: ALGOL 58. ALGOL 58 had no I/O facilities.
See main article: ALGOL 60. Since ALGOL 60 had no I/O facilities, there is no portable hello world program in ALGOL.The next three examples are in Burroughs Extended Algol. The first two direct output at the interactive terminal they are run on. The first uses a character array, similar to C. The language allows the array identifier to be used as a pointer to the array, and hence in a REPLACE statement.A simpler program using an inline format:An even simpler program using the Display statement. Note that its output would end up at the system console ('SPO'):
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 .Below is a version from Elliott 803 Algol (A104). The standard Elliott 803 used five-hole paper tape and thus only had upper case. The code lacked any quote characters so £ (UK 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. The open and close quote characters were represented using '(' and ')' and spaces by %.[25] 'BEGIN' WRITE TEXT('('HELLO%WORLD')'); 'END'
See main article: ALGOL 68.
ALGOL 68 code was published with reserved words typically in lowercase, but bolded or underlined. begin printf(($gl$,"Hello, world!")) endIn the language of the "Algol 68 Report" the input/output facilities were collectively called the "Transput".
The ALGOLs were conceived at a time when character sets were diverse and evolving rapidly; also, the ALGOLs were defined so that only uppercase letters were required.
1960: IFIP – The Algol 60 language and report included several mathematical symbols which are available on modern computers and operating systems, but, unfortunately, were unsupported on most computing systems at the time. For instance: ×, ÷, ≤, ≥, ≠, ¬, ∨, ∧, ⊂, ≡, ␣ and ⏨.
1961 September: ASCII – The ASCII character set, then in an early stage of development, had the \ (Back slash) character added to it in order to support ALGOL's boolean operators /\ and \/.[26]
1962: ALCOR – This character set included the unusual "᛭" runic cross[27] character for multiplication and the "⏨" Decimal Exponent Symbol[28] for floating point notation.[29] [30] [31]
1964: GOST – The 1964 Soviet standard GOST 10859 allowed the encoding of 4-bit, 5-bit, 6-bit and 7-bit characters in ALGOL.[32]
1968: The "Algol 68 Report" – used extant ALGOL characters, and further adopted →, ↓, ↑, □, ⌊, ⌈, ⎩, ⎧, ○, ⊥, and ¢ characters which can be found on the IBM 2741 keyboard with typeball (or golf ball) print heads inserted (such as the APL golf ball). These became available in the mid-1960s while ALGOL 68 was being drafted. The report was translated into Russian, German, French, and Bulgarian, and allowed programming in languages with larger character sets, e.g., Cyrillic alphabet of the Soviet BESM-4. All ALGOL's characters are also part of the Unicode standard and most of them are available in several popular fonts.
2009 October: Unicode – The ⏨ (Decimal Exponent Symbol) for floating point notation was added to Unicode 5.2 for backward compatibility with historic Buran programme ALGOL software.[33]
A significant contribution of the ALGOL 58 Report was to provide standard terms for programming concepts: statement, declaration, type, label, primary, block, and others.[34]
de:Richard Baumann (Mathematiker)
. Feliciano . Manuel . Bauer . Friedrich Ludwig . Friedrich Ludwig Bauer . Samelson . Klaus . Klaus Samelson . 1964 . Introduction to ALGOL–A Primer for the Non-Specialist, Emphasizing the Practical Uses of the Algorithmic Language . Automatic Computation . . Englewood Cliffs, NJ . 0134778286 . 64-10740 . ark:/13960/t6qz35p37 . 2022-10-23.de:Gerhard Goos
. . 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.