ALGOL_60

ALGOL 60

ALGOL 60

Member of the ALGOL family of computer programming languages

This article is about the programming language. For other uses, see Algol (disambiguation).

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.

Quick Facts Paradigms, Family ...

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.

Standardization

ALGOL 60 – with COBOL – were the first languages to seek standardization.

  • ISO 1538:1984 Programming languages – ALGOL 60 (stabilized)
  • ISO/TR 1672:1977 Hardware representation of ALGOL basic symbols ... (now withdrawn)

History

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]

ALGOL 60 implementations timeline

To date there have been at least 70 augmentations, extensions, derivations and sublanguages of ALGOL 60.[6]

More information Name, Year ...

The Burroughs dialects included special system programming dialects such as ESPOL and NEWP.

Properties

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.

ALGOL 60 Reserved words and restricted identifiers

There are 35 such reserved words in the standard Burroughs Large Systems sub-language:

  • ALPHA
  • ARRAY
  • BEGIN
  • BOOLEAN
  • COMMENT
  • CONTINUE
  • DIRECT
  • DO
  • DOUBLE
  • ELSE
  • END
  • EVENT
  • FALSE
  • FILE
  • FOR
  • FORMAT
  • GO
  • IF
  • INTEGER
  • LABEL
  • LIST
  • LONG
  • OWN
  • POINTER
  • PROCEDURE
  • REAL
  • STEP
  • SWITCH
  • TASK
  • THEN
  • TRUE
  • UNTIL
  • VALUE
  • WHILE
  • ZIP

There are 71 such restricted identifiers in the standard Burroughs Large Systems sub-language:

  • ACCEPT
  • AND
  • ATTACH
  • BY
  • CALL
  • CASE
  • CAUSE
  • CLOSE
  • DEALLOCATE
  • DEFINE
  • DETACH
  • DISABLE
  • DISPLAY
  • DIV
  • DUMP
  • ENABLE
  • EQL
  • EQV
  • EXCHANGE
  • EXTERNAL
  • FILL
  • FORWARD
  • GEQ
  • GTR
  • IMP
  • IN
  • INTERRUPT
  • IS
  • LB
  • LEQ
  • LIBERATE
  • LINE
  • LOCK
  • LSS
  • MERGE
  • MOD
  • MONITOR
  • MUX
  • NEQ
  • NO
  • NOT
  • ON
  • OPEN
  • OR
  • OUT
  • PICTURE
  • PROCESS
  • PROCURE
  • PROGRAMDUMP
  • RB
  • READ
  • RELEASE
  • REPLACE
  • RESET
  • RESIZE
  • REWIND
  • RUN
  • SCAN
  • SEEK
  • SET
  • SKIP
  • SORT
  • SPACE
  • SWAP
  • THRU
  • TIMES
  • TO
  • WAIT
  • WHEN
  • WITH
  • WRITE

and also the names of all the intrinsic functions.

Standard operators

More information Priority, Operator ...

Examples and portability issues

Code sample comparisons

ALGOL 60

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 PUNCH(3),££L??'
   B := SIN(A)'
   C := COS(A)'
   PRINT PUNCH(3),SAMELINE,ALIGNED(1,6),A,B,C'
 END'
 END'

ALGOL 60 family

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 Information Science 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:

<nowiki/>
 BEGIN
   FILE F(KIND=REMOTE);
   WRITE(F, <"HELLO WORLD!">);
 END.

An even simpler program using the Display statement:

BEGIN DISPLAY("HELLO WORLD!") END.

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   ’ .

<nowiki/>
 program HiFolks;
 begin
    print ‘Hello world’
 end;

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

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.

See also

References

  1. [1]
    Knuth, Donald E. (December 1964). "Backus normal Form vs Backus Naur Form". Communications of the ACM. 7 (12): 735–6. doi:10.1145/355588.365140. S2CID 47537431.
  2. [2]
    ACM Award Citation / Peter Naur, 2005
  3. [3]
    van Emden, Maarten (2014). "How recursion got into programming: a tale of intrigue, betrayal, and advanced programming-language semantics". A Programmer's Place.
  4. [4]
    Hoare, C.A.R. (December 1973). "Hints on Programming Language Design" (PDF). p. 27. (This statement is sometimes erroneously attributed to Edsger W. Dijkstra, also involved in implementing the first ALGOL 60 compiler.)
  5. [5]
    Abelson, Hal; Dybvig, R. K.; et al. Rees, Jonathan; Clinger, William (eds.). "Revised(3) Report on the Algorithmic Language Scheme (Dedicated to the Memory of ALGOL 60)". Retrieved 2009-10-20.
  6. [6]
    The Encyclopedia of Computer Languages Archived September 27, 2011, at the Wayback Machine
  7. [7]
    Daylight, E. G. (2011). "Dijkstra's Rallying Cry for Generalization: the Advent of the Recursive Procedure, late 1950s – early 1960s". The Computer Journal. 54 (11): 1756–1772. doi:10.1093/comjnl/bxr002.
  8. [8]
    Kruseman Aretz, F.E.J. (30 June 2003). "The Dijkstra-Zonneveld ALGOL 60 compiler for the Electrologica X1" (PDF). Software Engineering. History of Computer Science. Amsterdam: Centrum Wiskunde & Informatica. ISSN 1386-3711. Archived from the original (PDF) on 2004-01-17.
  9. [9]
    Irons, Edgar T., A syntax directed compiler for ALGOL 60, Communications of the ACM, Vol. 4, p. 51. (Jan. 1961)
  10. [10]
    Kurtz, Thomas E. (1978). "BASIC". History of programming languages. pp. 515–537. doi:10.1145/800025.1198404. ISBN 0127450408.
  11. [11]
    Gries, D.; Paul, M.; Wiehle, H. R (1965). "Some techniques used in the ALCOR Illinois 7090". Communications of the ACM. 8 (8): 496–500. doi:10.1145/365474.365511. S2CID 18365024.
  12. [12]
    Bayer, R.; Gries, D.; Paul, M.; Wiehle, H. R. (1967). "The ALCOR Illinois 7090/7094 post mortem dump". Communications of the ACM. 10 (12): 804–808. doi:10.1145/363848.363866. S2CID 3783605.
  13. [13]
    Rechenautomaten mit Trommelspeicher, Förderverein der Technischen Sammlung Dresden
  14. [14]
    Mounier-Kuhn, Pierre (2014). "Algol in France: From Universal Project to Embedded Culture". IEEE Annals of the History of Computing. 36 (4): 6. ISSN 1058-6180.
  15. [15]
    Kurtz, op. cit., page 517.
  16. [16]
    Boussard, Jean-Claude (June 1964). Etude et réalisation d'un compilateur Algol60 sur calculateur éléctronique du type IBM 7090/94 et 7040/44 [Design and implementation of a compiler Algol60 on electronic calculator IBM 7090/94 and 7040/44] (PhD) (in French). Université Joseph-Fourier - Grenoble I.
  17. [17]
    Claude Pair (27 April 1965). Description d'un compilateur ALGOL. European Région 1620 Users Group. IBM.
  18. [18]
    Kruseman Aretz, F.E.J. (1973). An Algol 60 compiler in Algol 60. Mathematical Centre Tracts. Amsterdam: Mathematisch Centrum.
  19. [19]
    Aho, Alfred V.; Sethi, Ravi; Ullman, Jeffrey D. (1986). Compilers: Principles, Techniques, and Tools (1st ed.). Addison-Wesley. ISBN 978-0-201-10194-2., Section 7.5, and references therein
  20. [20]
    "803 ALGOL", the manual for Elliott 803 ALGOL
  21. [21]
    "The ALGOL Programming Language". www.engin.umd.umich.edu. Archived from the original on 10 February 2010. Retrieved 11 January 2022.
  22. [22]
    "Hello world! Example Program". www.engin.umd.umich.edu. Archived from the original on 4 February 2010. Retrieved 11 January 2022.
  23. [23]
    Fortran#"Hello, World!" example
  24. [24]
    "ICL 1900 series: Algol Language". ICL Technical Publication 3340. 1965.

Further reading
Share this article:

This article uses material from the Wikipedia article ALGOL_60, and is written by contributors. Text is available under a CC BY-SA 4.0 International License; additional terms may apply. Images, videos and audio are available under their respective licenses.