Abstract
The method underlying the Vienna formal PL/I definition is outlined; current developments in the direction of reduction and simplification are indicated.
(Manuscript for publication in the Proceedings of the International Computing Symposium, Bonn 1970)
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.W.de Bakker: Semantics of Programming Languages. — Mathematisch Centrum Amsterdam, 1968 (unpublished).
H. Bekić: Mechanical Transformation Rules for the Reduction of Algol to a Primitive Language M and their Use in Defining the Compiler Function. — IBM Laboratory Vienna, Techn. Rep. TR 25.051, 1965.
H. Bekić, K. Walk: Formalisation of Storage Properties.— To be published in: E. Engeler (Ed.): Symposium on the Semantics of Algorithmic Languages, Springer Lecture Notes.
R.M. Burstall: Formal Description of Program Structure and Semantics in First Order Logic.— In: B. Meltzer, D. Michie (Eds.): Machine Intelligence 5, pp. 79–98, Edinburgh 1969.
R.M. Burstall, P.J. Landin: Programs and their Proofs: an Algebraic Approach.— In: B. Meltzer, D. Michie (Eds.): Machine Intelligence 4, pp.17–43, Edinburgh 1968.
A. Church: The Calculi of Lambda-Conversion.— Princeton University Press, 1941.
C.C. Elgot, A. Robinson: Random-Access Stored-Program Machines. An Approach to Programming Languages.— J. ACM 11 (1964), No.4, pp. 365–399.
C.A.R. Hoare: An Axiomatic Basis for Computer Programs.— Comm. ACM 12 (1969), No.10, pp.576–580.
C.B. Jones, P. Lucas: Proving Correctness of Implementation Techniques.— To be published in: E. Engeler (Ed.): Symposium on the Semantics of Algorithmic Languages, Springer Lecture Notes.—
G. Kreisel, J.L. Krivine: Elements of Mathematical Logic Model Theory).— North-Holland, Amsterdam 1967.
P.J. Landin: The Mechanical Evaluation of Expressions.— Comp. J. 6 (1964), No.4, pp. 308–320.
P.J. Landin: A Correspondence between ALGOL 60 and Church's Lambda-Notation.— Comm. ACM 8 (1965), No.2, pp. 89–101 and No.3, pp. 158–165.
P.J. Landin: A Program Machine Symmetric Automata Theory.— In. B. Meltzer, D. Michie (Eds.): Machine Intelligence 5, pp. 99–120, Edinburgh 1969.
P. Lauer: Formal Definition of ALGOL 60.— IBM Laboratory Vienna, Techn. Rep. TR 25.088, 1968.
P. Lucas, K. Walk: On the Formal Description of PL/I.— Annual Review in Automatic Programming 6 (1969), Part 3, pp. 105–152, Pergamon Press.
J. McCarthy: Towards a Mathematical Science of Computation.— In: C.M. Popplewell (Ed.): Information Processing 1962, pp.21–28, North Holland, Amsterdam 1963.
J. McCarthy: Problems in the Theory of Computation.— In: W.A. Kalenich (Ed.): Information Processing 1965, pp. 219–222, Spartan Books, Washington 1965.
D. Scott: Outline of a Mathematical Theory of Computation.— In: Proceedings of the Fourth Annual Princeton Conference on Information Sciences and Systesm, 1970.
K. Walk et al.: Abstract Syntax and Interpretation of PL/I.— IBM Laboratory Vienna, Techn. Rep. TR 25.098, 1969.
A. van Wijngaarden (Ed.), B.J. Mailloux, J.E.L. Peck, C.H.A. Koster: Report on the Algorithmic Language ALGOL 68.— Mathematisch Centrum Amsterdam, MR 101, 1969.
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bekic, H. (1984). On the formal definition of programming languages. In: Jones, C.B. (eds) Programming Languages and Their Definition. Lecture Notes in Computer Science, vol 177. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0048941
Download citation
DOI: https://doi.org/10.1007/BFb0048941
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13378-0
Online ISBN: 978-3-540-38933-0
eBook Packages: Springer Book Archive