ALGOL 60

Last updated
ALGOL 60
Paradigms procedural, imperative, structured
Family ALGOL
Designed by Backus, Bauer, Green, Katz, McCarthy, Naur, Perlis, Rutishauser, Samelson, van Wijngaarden, Vauquois, Wegstein, Woodger
First appeared1960;65 years ago (1960)
Typing discipline 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[ clarification needed ]), 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.

Contents

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.

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]

NameYearAuthorStateDescriptionTarget CPU
X1 ALGOL 60August 1960 [7] Edsger W. Dijkstra and Jaap A. Zonneveld Flag of the Netherlands.svg  Netherlands First implementation of ALGOL 60 [8] Electrologica X1
Algol1960 [9] Edgar T. IronsFlag of the United States.svg  USA ALGOL 60 CDC 1604
Burroughs Algol
(Several variants)
1961 Burroughs Corporation (with participation by Hoare, Dijkstra, and others)Flag of the United States.svg  USA Basis of the Burroughs (and now Unisys MCP based) computers Burroughs Large Systems
and midrange systems
Case ALGOL 1961Flag of the United States.svg  USA Simula was originally contracted as a simulation extension of the Case ALGOL UNIVAC 1107
GOGOL 1961 William M. McKeeman Flag of the United States.svg  USA For ODIN time-sharing system PDP-1
DASK ALGOL 1961 Peter Naur, Jørn Jensen Flag of Denmark.svg  Denmark ALGOL 60DASK at Regnecentralen
SMIL ALGOL 1962 Torgil Ekman, Carl-Erik Fröberg Flag of Sweden.svg  Sweden ALGOL 60 SMIL at Lund University
GIER ALGOL 1962 Peter Naur, Jørn Jensen Flag of Denmark.svg  Denmark ALGOL 60GIER at Regnecentralen
Dartmouth ALGOL 30 [10] 1962 Thomas Eugene Kurtz, Stephen J. Garland, Robert F. Hargraves, Anthony W. Knapp, Jorge LLacer Flag of the United States.svg  USA ALGOL 60 LGP-30
Alcor Mainz 20021962Ursula Hill-Samelson, Hans LangmaackFlag of Germany.svg  Germany Siemens 2002
ALCOR-Illinois 70901962
[11] [12]
Manfred Paul, Hans Rüdiger Wiehle, David Gries, and Rudolf Bayer Flag of the United States.svg  USA, Flag of Germany.svg  West Germany ALGOL 60
Implemented at Illinois and the TH München, 1962-1964
IBM 7090
USS 90 Algol 1962 L. Petrone Flag of Italy.svg  Italy
Elliott ALGOL 1962 C. A. R. Hoare Flag of the United Kingdom.svg  UK Discussed in his 1980 Turing Award lecture Elliott 803 & the Elliott 503
ALGOL 601962Roland Strobel [13] Flag of East Germany.svg  East Germany Implemented by the Institute for Applied Mathematics, German Academy of Sciences at Berlin Zeiss-Rechenautomat ZRA 1
ALGOL 601962 Bernard Vauquois, Louis Bolliet [14] Flag of France.svg  France Institut d'Informatique et Mathématiques Appliquées de Grenoble (IMAG) and Compagnie des Machines Bull Bull Gamma 60
Algol Translator1962G. van der Mey and W.L. van der Poel Flag of the Netherlands.svg  Netherlands Staatsbedrijf der Posterijen, Telegrafie en Telefonie ZEBRA
Kidsgrove Algol 1963 F. G. Duncan Flag of the United Kingdom.svg  UK English Electric Company KDF9
SCALP [15] 1963 Stephen J. Garland, Anthony W. Knapp, Thomas Eugene Kurtz Flag of the United States.svg  USA Self-Contained ALgol Processor for a subset of ALGOL 60 LGP-30
VALGOL 1963 Val Schorre Flag of the United States.svg  USA A test of the META II compiler compiler
FP6000 Algol1963 Roger Moore Flag of Canada (Pantone).svg  Canada written for Saskatchewan Power Corp FP6000
Whetstone 1964 Brian Randell and Lawford John RussellFlag of the United Kingdom.svg  UK Atomic Power Division of English Electric Company. Precursor to Ferranti Pegasus, National Physical Laboratories ACE and English Electric DEUCE implementationsEnglish Electric Company KDF9
ALGOL 601964Jean-Claude Boussard [16] Flag of France.svg  France Institut d'informatique et mathématiques appliquées de Grenoble  [ fr ] IBM 7090
ALGOL-GENIUS1964Börje LangeforsFlag of Sweden.svg  Sweden Added COBOL-inspired data records and I/O Datasaab D-21
ALGOL 601965 Claude Pair  [ fr ] [17] Flag of France.svg  France Centre de calcul de la Faculté des Sciences de Nancy IBM 1620
Dartmouth ALGOL1965 Stephen J. Garland, Sarr Blumson, Ron MartinFlag of the United States.svg  USA ALGOL 60 Dartmouth Time-Sharing System for the GE 235
NU ALGOL 1965Flag of Norway.svg  Norway UNIVAC
ALGOL 601965 [18] F.E.J. Kruseman AretzFlag of the Netherlands.svg  Netherlands MC compiler for the EL-X8 Electrologica X8
ALGEK1965Flag of the Soviet Union.svg  Soviet Union Minsk-22 АЛГЭК, based on ALGOL 60 and COBOL support, for economical tasks
MALGOL 1966publ. A. Viil, M Kotli & M. Rakhendi,Flag of the Estonian Soviet Socialist Republic.svg  Estonian SSR Minsk-22
ALGAMS 1967GAMS group (ГАМС, группа автоматизации программирования для машин среднего класса), cooperation of Comecon Academies of Science Comecon Minsk-22, later ES EVM, BESM
ALGOL/ZAM 1967Flag of Poland.svg  Poland Polish ZAM computer
Chinese Algol 1972Flag of the People's Republic of China.svg  China Chinese characters, expressed via the Symbol system
DG/L 1972Flag of the United States.svg  USA DG Eclipse family of Computers
NASE 1990Erik SchoenfelderFlag of Germany.svg  Germany InterpreterLinux and MS Windows
MARST 2000Andrew MakhorinFlag of Russia.svg  Russia ALGOL 60 to C translatorAll 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.

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.

Language levels

The ALGOL 60 reports recognize three different levels of language, i.e., a Reference Language, a Publication Language, and several Hardware Representations. The Reference and Publication languages have no reserved words, however the reports do recommend [20] reserving some identifiers for standard functions.

The reports briefly describe hardware representations. Implementations differ in their hardware representations of underlined independent basic symbols [21]

  1. Reserved words
  2. Stropping

ALGOL 60 Reserved words and restricted identifiers

There are 24 reserved words in the Modified Report:

  • ARRAY
  • BEGIN
  • BOOLEAN
  • COMMENT
  • DO
  • ELSE
  • END
  • FALSE
  • FOR
  • GOTO
  • IF
  • INTEGER
  • LABEL
  • OWN
  • PROCEDURE
  • REAL
  • STEP
  • STRING
  • SWITCH
  • THEN
  • TRUE
  • UNTIL
  • VALUE
  • WHILE

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

PriorityOperator
first arithmeticfirst↑ (power)
second×, / (real), ÷ (integer)
third+, -
second<, ≤, =, ≥, >, ≠
third¬ (not)
fourth∧ (and)
fifth∨ (or)
sixth⊃ (implication)
seventh≡ (equivalence)

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; begininteger p, q;     y := 0; i := k := 1;     for p := 1 step 1 until n dofor q := 1 step 1 until m doif abs(a[p, q]) > y thenbegin y := abs(a[p, q]);                     i := p; k := q                 endend 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: [22]

 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 [23] at the University of Michigan-Dearborn Computer and Information Science Department Hello world! ALGOL Example Program page. [24]

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. [25]

A simpler program using an inline format:

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

An even simpler program using the Display statement:

BEGINDISPLAY("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/>programHiFolks;beginprintHelloworldend;

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 %. [26]

  '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

Related Research Articles

<span class="mw-page-title-main">ALGOL</span> Family of programming languages

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

Atlas Autocode (AA) is a programming language developed around 1963 at the University of Manchester. A variant of the language ALGOL, it was developed by Tony Brooker and Derrick Morris for the Atlas computer. The initial AA and AB compilers were written by Jeff Rohl and Tony Brooker using the Brooker-Morris Compiler-compiler, with a later hand-coded non-CC implementation (ABC) by Jeff Rohl.

<span class="mw-page-title-main">Simula</span> Early object-oriented programming language

Simula is the name of two simulation programming languages, Simula I and Simula 67, developed in the 1960s at the Norwegian Computing Center in Oslo, by Ole-Johan Dahl and Kristen Nygaard. Syntactically, it is an approximate superset of ALGOL 60, and was also influenced by the design of Simscript.

SNOBOL is a series of programming languages developed between 1962 and 1967 at AT&T Bell Laboratories by David J. Farber, Ralph Griswold and Ivan P. Polonsky, culminating in SNOBOL4. It was one of a number of text-string-oriented languages developed during the 1950s and 1960s; others included COMIT and TRAC.

<span class="mw-page-title-main">Peter Naur</span> Danish computer science pioneer

Peter Naur was a Danish computer science pioneer and 2005 Turing award winner. He is best remembered as a contributor, with John Backus, to the Backus–Naur form (BNF) notation used in describing the syntax for most programming languages. He also contributed to creating the language ALGOL 60.

In computer science, Backus–Naur form is a notation used to describe the syntax of programming languages or other formal languages. It was developed by John Backus and Peter Naur. BNF can be described as a metasyntax notation for context-free grammars. Backus–Naur form is applied wherever exact descriptions of languages are needed, such as in official language specifications, in manuals, and in textbooks on programming language theory. BNF can be used to describe document formats, instruction sets, and communication protocols.

<span class="mw-page-title-main">John Backus</span> American computer scientist

John Warner Backus was an American computer scientist. He led the team that invented and implemented FORTRAN, the first widely used high-level programming language, and was the inventor of the Backus–Naur form (BNF), a widely used notation to define syntaxes of formal languages. He later did research into the function-level programming paradigm, presenting his findings in his influential 1977 Turing Award lecture "Can Programming Be Liberated from the von Neumann Style?"

In computer science, a high-level programming language is a programming language with strong abstraction from the details of the computer. In contrast to low-level programming languages, it may use natural language elements, be easier to use, or may automate significant areas of computing systems, making the process of developing a program simpler and more understandable than when using a lower-level language. The amount of abstraction provided defines how "high-level" a programming language is.

ALGOL W is a programming language. It is based on a proposal for ALGOL X by Niklaus Wirth and Tony Hoare as a successor to ALGOL 60. ALGOL W is a relatively simple upgrade of the original ALGOL 60, adding string, bitstring, complex number and reference to record data types and call-by-result passing of parameters, introducing the while statement, replacing switch with the case statement, and generally tightening up the language.

In computer programming, a block or code block or block of code is a lexical structure of source code which is grouped together. Blocks consist of one or more declarations and statements. A programming language that permits the creation of blocks, including blocks nested within other blocks, is called a block-structured programming language. Blocks are fundamental to structured programming, where control structures are formed from blocks.

<span class="mw-page-title-main">ALGOL 68</span> Programming language

ALGOL 68 is an imperative programming language that was conceived as a successor to the ALGOL 60 programming language, designed with the goal of a much wider scope of application and more rigorously defined syntax and semantics.

ALGOL 58, originally named IAL, is one of the family of ALGOL computer programming languages. It was an early compromise design soon superseded by ALGOL 60. According to John Backus:

The Zurich ACM-GAMM Conference had two principal motives in proposing the IAL: (a) To provide a means of communicating numerical methods and other procedures between people, and (b) To provide a means of realizing a stated process on a variety of machines...

The man or boy test was proposed by computer scientist Donald Knuth as a means of evaluating implementations of the ALGOL 60 programming language. The aim of the test was to distinguish compilers that correctly implemented "recursion and non-local references" from those that did not.

There are quite a few ALGOL60 translators in existence which have been designed to handle recursion and non-local references properly, and I thought perhaps a little test-program may be of value. Hence I have written the following simple routine, which may separate the man-compilers from the boy-compilers.

The TPK algorithm is a simple program introduced by Donald Knuth and Luis Trabb Pardo to illustrate the evolution of computer programming languages. In their 1977 work "The Early Development of Programming Languages", Trabb Pardo and Knuth introduced a small program that involved arrays, indexing, mathematical functions, subroutines, I/O, conditionals and iteration. They then wrote implementations of the algorithm in several early programming languages to show how such concepts were expressed.

ALGO is an algebraic programming language developed for the Bendix G-15 computer.

Jensen's device is a computer programming technique that exploits call by name. It was devised by Danish computer scientist Jørn Jensen, who worked with Peter Naur at Regnecentralen. They worked on the GIER ALGOL compiler, one of the earliest correct implementations of ALGOL 60. ALGOL 60 used call by name. During his Turing Award speech, Naur mentions his work with Jensen on GIER ALGOL.

S-algol is a computer programming language derivative of ALGOL 60 developed at the University of St Andrews in 1979 by Ron Morrison and Tony Davie. The language is a modification of ALGOL to contain orthogonal data types that Morrison created for his PhD thesis. Morrison would go on to become professor at the university and head of the department of computer science. The S-algol language was used for teaching at the university at an undergraduate level until 1999. It was also the language taught for several years in the 1980s at a local school in St. Andrews, Madras College. The computer science text Recursive Descent Compiling describes a recursive descent compiler for S-algol, implemented in S-algol.

PL360 is a system programming language designed by Niklaus Wirth and written by Wirth, Joseph W. Wells Jr., and Edwin Satterthwaite Jr. for the IBM System/360 computer at Stanford University. A description of PL360 was published in early 1968, although the implementation was probably completed before Wirth left Stanford in 1967.

<span class="mw-page-title-main">History of compiler construction</span>

In computing, a compiler is a computer program that transforms source code written in a programming language or computer language, into another computer language. The most common reason for transforming source code is to create an executable program.

DG/L is a programming language developed by Data General Corp for the Nova, Eclipse, and Eclipse/MV families of minicomputers in the 1970s and early 1980s.

References

  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. ACM Award Citation / Peter Naur, 2005
  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. 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. 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. The Encyclopedia of Computer Languages Archived September 27, 2011, at the Wayback Machine
  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. 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. Irons, Edgar T., A syntax directed compiler for ALGOL 60, Communications of the ACM, Vol. 4, p. 51. (Jan. 1961)
  10. Kurtz 1978.
  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. 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. Rechenautomaten mit Trommelspeicher, Förderverein der Technischen Sammlung Dresden
  14. Mounier-Kuhn, Pierre (2014). "Algol in France: From Universal Project to Embedded Culture". IEEE Annals of the History of Computing. 36 (4): 6–25. doi:10.1109/MAHC.2014.50. ISSN   1058-6180.
  15. Kurtz 1978, p. 517.
  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. Claude Pair (27 April 1965). Description d'un compilateur ALGOL. European Région 1620 Users Group. IBM.
  18. Kruseman Aretz, F.E.J. (1973). An Algol 60 compiler in Algol 60. Mathematical Centre Tracts. Amsterdam: Mathematisch Centrum.
  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. Naur et al. 1963 , 3.2.4. Standard functions
  21. Naur et al. 1963 , 2.1. Letters: (1) It should be particularly noted that throughout the reference language underlining [here this looks like underlined; N.L.] is used for defining independent basic symbols (see sections 2.2.2 and 2.3). These are understood to have no relation to the individual letters of which they are composed. Within the present report underlining will be used for no other purposes.
  22. "803 ALGOL", the manual for Elliott 803 ALGOL
  23. "The ALGOL Programming Language". www.engin.umd.umich.edu. Archived from the original on 10 February 2010. Retrieved 11 January 2022.
  24. "Hello world! Example Program". www.engin.umd.umich.edu. Archived from the original on 4 February 2010. Retrieved 11 January 2022.
  25. Fortran#"Hello, World!" example
  26. "ICL 1900 series: Algol Language". ICL Technical Publication 3340. 1965.

Bibliography

Further reading