Correspondence between ALGOL 60 and Church's Lambda-notation
@article{Landin1965CorrespondenceBA, title={Correspondence between ALGOL 60 and Church's Lambda-notation}, author={Peter J. Landin}, journal={Communications of the ACM}, year={1965}, volume={8}, pages={89 - 101} }
This paper describes how some of the semantics of ALGOL 60 can be formalized by establishing a correspondence between expressions of ALGOL 60 and expressions in a modified form of Church's n-notation. First a model for computer languages and computer behavior is described, based on the notions of functional application and functional abstraction, but also having analogues for imperative language features. Then |his model is used as an "abstract object language" into which ALGOL 60 is mapped…
Tables from this paper
398 Citations
An Algorithmic Semantics for ALGOL 60 Identifier Denotation
- Computer ScienceJACM
- 1970
The algorithms for identifier denotation transform an Algol 60 program into one in which no identifier is ever redeclared; hence they unambiguously associate each identifier with its proper declaration.
The origins of structural operational semantics
- Computer ScienceJ. Log. Algebraic Methods Program.
- 2004
An Exegesis of Four Formal Descriptions of ALGOL 60
- Computer Science
- 2016
The main challenges in providing a formal semantics for imperative programming languages are identified and the responses to these challenges are reviewed in four relatively complete formal descriptions of ALGOL 60.
Algol-like Language
- Computer Science, Mathematics
- 1995
A denotational semantics for an Algol-like language Alg is presented, which is fully abstract for the second order subset of Alg, which constitutes the first full abstraction result for a block structured language with local variables.
Introduction to Operational Semantics
- Computer ScienceThe Compiler Design Handbook
- 2002
This chapter presents the syntax of a programming language, IMP, a small language of while programs, described by rules which specify how its expressions are evaluated and its commands are executed, and how these rules furnish a basis for simple proofs of equivalence between commands.
Revised5 Report on the Algorithmic Language Scheme
- Computer ScienceHigh. Order Symb. Comput.
- 1998
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…
Formal Semantics of ALGOL 60: Four Descriptions in their Historical Context
- Computer Science
- 2018
The main challenges in providing formal semantics for imperative programming languages are identified and the responses to these challenges are reviewed in four relatively complete formal descriptions of ALGOL 60.
Circular Expressions: Elimination of Static Environments
- Computer ScienceSci. Comput. Program.
- 1982
Type Systems for Programming Languages
- Computer ScienceHandbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
- 1990
References
SHOWING 1-10 OF 28 REFERENCES
The Mechanical Evaluation of Expressions
- Computer ScienceComput. J.
- 1964
It is shown how some forms of expression in current programming languages can be modelled in Church's X-notation, and a way of "interpreting" such expressions is described, which suggests a method of analyzing the things computer users write.
LISP 1.5 Programmer's Manual
- Computer Science
- 1962
The LISP language is designed primarily for symbolic data processing used for symbolic calculations in differential and integral calculus, electrical circuit theory, mathematical logic, game playing,…
Revised report on the algorithm language ALGOL 60
- Computer ScienceCACM
- 1963
a survey of the basic coustituents arid fcuturcs of the language is given, and the formal notation, by which the syntactic structure is defined, is esplaincd. The sccnnd chapter lists all the basic…
The Main Features of CPL
- Computer ScienceComput. J.
- 1963
The paper provides an informal account of CPL, a new programming language currently being implemented for the Titan at Cambridge and the Atlas at London University. CPL is based on, and contains the…
Some proposals for improving the efficiency of ALGOL 60
- Computer ScienceCACM
- 1961
A number of defects in AL(~OL which it appears to us must be eliminated before the language can achieve full success as a means of programmin~ computers for serious work are drawn up.
Design of a separable transition-diagram compiler
- Computer ScienceCACM
- 1963
A COBOL compiler design is presented which is compact enough to permit rapid, one-pass compilation of a large subset of COBOL on a moderately large computer. Versions of the same compiler for smaller…
Towards a Mathematical Science of Computation
- PhysicsIFIP Congress
- 1962
The prospects for a mathematical science of computation is discussed and it is shown that from Newton’s law of gravitation and his laws of motion, one can deduce that the planetary orbits obey Kepler's laws.
A formal dcseription of AL(R)L 60. l'r(~s(q~ted at IFIP Workiltg Conf
- A formal dcseription of AL(R)L 60. l'r(~s(q~ted at IFIP Workiltg Conf
- 1964
Recursive definition of symax and semantics
- Presented at IFIP Working Conf .
- 1964
Recursive definition of symax and semantics. Presented at IFIP Working Conf
- Recursive definition of symax and semantics. Presented at IFIP Working Conf
- 1964