Abstract
This note discusses methods of defining the for statement in high level languages and suggests a proof rule intended to reflect the proper role of a for statement in computer programming. It concludes with a suggestion for possible generalisation.
Similar content being viewed by others
References
N. Wirth,The Programming Language PASCAL, Acta Informatica 1.1 (1971), 35–63.
N. Wirth and C. A. R. Hoare,A contribution to the development of ALGOL, C.A.C.M. 9.6 (June 1966).
A. van Wijngaarden (ed.),Report on the Algorithmic Language ALGOL 68, Numerische Mathematik 14 (1969), 79–218.
C. A. R. Hoare,An Axiomatic Approach to Computer Programming, C.A.C.M. 12. 10 (Oct. 1969), 576–580, 583.
R. W. Floyd,Assigning Meanings to Programs, Proc. Amer. Math. Soc. Symposium in Applied Mathematics, Vol. 19, pp. 19–31.
P. Naur,Proof of Algorithms by General Snapshots, BIT 6 (1966), 310–316.
C. A. R. Hoare,Cleaning up the For Statement, ALGOL Bulletin 21.3.4 (July 1965), 32–35.
C. A. R. Hoare,Subscript Optimisation and Subscript Checking, ALGOL Bulletin 29.3.6 (Nov. 1968), 33–44.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hoare, C.A.R. A note on the for statement. BIT 12, 334–341 (1972). https://doi.org/10.1007/BF01932305
Received:
Issue date:
DOI: https://doi.org/10.1007/BF01932305