Summary
The axiomatic definition method proposed in reference [5] is extended and applied to define the meaning of the programming language PASCAL [1]. The whole language is covered with the exception of real arithmetic and go to statements.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Wirth, N.: The programming language PASCAL. Acta Informatica 1, 35–63 (1971)
Naur, P. (Ed.): Revised report on the algorithmic language ALGOL 60. Comm. ACM 6, 1–17 (1963); Comp. J. 5, 349–367 (1962/63); Numer. Math. 4, 420–453 (1963)
Wirth, N.: The design of a PASCAL compiler. Software, Practice and Experience 1, 309–333 (1971)
Welsh, J., Quinn, C.: A PASCAL compiler for the ICL 1900 Series Computers. Software, Practice and Experience 2, 73–77 (1972)
Hoare, C. A. R.: An axiomatic basis for computer programming. Comm. ACM 12, 576–581 (1969)
Hoare, C. A. R. : An axiomatic definition of the programming language PASCAL, Second Draft. Proc. Symposium on Theoretical Programming, Novosibirsk, Aug. 1972
Hoare, C. A. R.: Notes on data structuring. In: Dahl, O.-J., Dijkstra, E. W., and Hoare, C. A. R.: Structured programming. London und New York: Academic Press 1972
Hoare, C. A. R.: A note on the for statement. BIT 12, 334–341 (1972)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hoare, C.A.R., Wirth, N. An axiomatic definition of the programming language PASCAL. Acta Informatica 2, 335–355 (1973). https://doi.org/10.1007/BF00289504
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00289504