Report on the algorithmic language ALGOL 60

@article{Backus1960ReportOT,
  title={Report on the algorithmic language ALGOL 60},
  author={John Warner Backus and Friedrich L. Bauer and Julien Green and C. Katz and John McCarthy and Alan J. Perlis and Heinz Rutishauser and Klaus Samelson and Bernard Vauquois and Joseph Henry Wegstein and Adriaan van Wijngaarden and Michael Woodger},
  journal={Numerische Mathematik},
  year={1960},
  volume={2},
  pages={106-136}
}
After the publication of a preliminary report on the algorithmic language ALGOL,!' 2 as prepared at a conference in Zurich in 1958, much interest in the ALGOL language developed. As a result of an informal meeting held at Mainz in November 1958, about forty interested persons from several European countries held an ALGOL implementation conference in Copenhagen in February 1959. A "hardware group" was formed for working cooperatively right down to the level of the paper tape code. This… 
Implementation of ALGOL 60 for the English Electric KDF9
TLDR
The decision to implement ALGOL 60 for the KDF9 was taken because the possibility of its use as an automatic programming language for a wide range of users, particularly those who had become accustomed to working with earlier languages, was seen.
Universality versus Locality: The Amsterdam Style of Algol Implementation
TLDR
This article elaborates on the tension between universality and locality by contrasting the Amsterdam and Munich styles of programming by highlighting Edsger Dijkstra's concept of a machine-independent object language.
ALGOL 60 confidential
TLDR
In this paper some of the more obscure features of the language are considered and their usefulness is discussed, and ALGOL seems to have become too general.
A compiler-building system developed by Brooker and Morris: including a comprehensive discussion of the major features of the system
TLDR
The present paper describes some of the major features of the Ferranti Atlas computer programming system, and expands on some points that the original authors cover briefly, and treats only very lightly some topics to which they devote considerable space.
A redundancy check for ALGOL programs
TLDR
The solution which is proposed is directed particularly to ALGOL 60, but the same problems exist with other common languages, and the principles which are used could be readily adapted to them.
Two Families of Languages Related to ALGOL
TLDR
The purpose of this investigation is to gain some insight into the syntax of POL, in particular ALGOL, and finds that the defining scheme for ALOOL turns out to be equivalent to one of the several schemes described by Chomsky in his attempt to analyze the morphology of natural languages.
On Revival of Algol-Concepts in Modern Programming and Specification Languages
  • H. Langmaack
  • Computer Science
    Formal Methods and Hybrid Real-Time Systems
  • 2007
TLDR
Aim of the present essay is to show that many of those new concepts incorporated in new Java and Turbo ASM were already available in Algol60.
Revised5 Report on the Algorithmic Language Scheme
The report gives a defining description of the programming language Scheme. Scheme is a statically scoped and properly tail-recursive dialect of the Lisp programming language invented by Guy Lewis
Specification languages for mechanical languages and their processors a baker's dozen: a set of examples presented to ASA x3.4 subcommittee
TLDR
The computing community has now matured to a point where it should recognize the need for discipline and clarity in communication among humans, relative to communication between humans and machines, and this paper aids language development.
A syntax controlled generator of formal language processors
TLDR
An important general principle in processing formal languages was the cellar principle, introduced in 1957 by F. L. Bauer and K. Samelson, which proved to be applicable in translating programs from the algorithmic language ALGOL into machine code or into a computer-oriented, macro instruction language.
...
...

References

Preliminary report: international algebraic language
TLDR
This appears to be a natural method for a 256 memory machine, if it had good indexing and looping features and the contribution of the left-hand term becomes proportionately large enough such that it alone might be used within accuracy limits after a certain number of digits are developed.