The assignment axiom and programming language design
Pages 2 - 6
Abstract
One way to approach software reliability is to design programming languages that satisfy criteria which ensure that undesirable semantic effects cannot occur. The effect of using the assignment rule of Hoare as such a criterion on the design of procedure-oriented, block-structured programming languages is investigated; after details of the Hoare formalism are discussed, language design guidelines derived from formal studies are informally presented and justified.
References
[1]
Maurice Clint and C.A.R. Hoare, Program Proving: Jumps and Functions, Acta Informatica, vol. 1, no. 3, 1972.
[2]
Jack B. Dennis, On Storage Management for Advanced Programming Languages, M.I.T. Computation Structures Group Memo 109-1, -M.I.T., 1974.
[3]
Jack B. Dennis and Joseph E. Stoy, A Tutorial Guide to the Semantics of Programming Languages, research report, M.I.T., 1975.
[4]
Edsger W. Dijkstra, A Simple Axiomatic Basis for Programming Language Constructs, Technical Monograph EWD372, Eindhoven, 1973.
[5]
James E. Donahue, The Mathematical Semantics of Axiomatically Defined Programming Language Constructs, Proc. International Symposium on Proving and Improving Programs, IRIA, 1975, 353-370.
[6]
James E. Donahue, Complementary Definitions of Programming Language Semantics, Technical Report CSRG-62, Computer Systems Research Group, University of Toronto, 1975.
[7]
Susan Gerhart, Presentation at the International Symposium on Proving and Improving Programs, IRIA, 1975.
[8]
John B. Goodenough, Structured Exception Handling, Communications of the ACM, vol. 18, no. 12, 1975.
[9]
C.A.R. Hoare, An Axiomatic Basis for Computer Programming, Communications of the ACM, vol. 12, no. 10, 1969.
[10]
C.A.R. Hoare, Procedures and Parameters: An Axiomatic Approach, Symposium on Semantics of Algorithmic Languages, E. Engeler, ed., Springer-Verlag, Heidelberg, 1971, 102-117.
[11]
C.A.R. Hoare and Peter Lauer, Consistent and Complementary Formal Theories of the Semantics of Programming Languages, Acta Informatica, vol. 3, no. 2, 1974.
[12]
C.A.R. Hoare and Niklaus Wirth, An Axiomatic Definition of the Programming Language PASCAL, Acta Informatica, vol. 2, no. 4, 1973.
[13]
Donald E. Knuth, The Remaining Trouble Spots in Algol, Communications of the ACM, vol. 10, no. 10, 1967.
[14]
Donald E. Knuth, Structured Programming With Goto Statements, ACM Computing Surveys, vol. 6, no. 4, 1974.
[15]
George T. Ligler, A Mathematical Approach to Language Design, Conf. Record of the 2nd ACM SIGACT/SIGPLAN Symposium on Principles of Programming Languages, Palo Alto, 1975, 41-53.
[16]
George T. Ligler, Proof Rules, Mathematical Semantics, and Programming Language Design, D.Phil. Thesis, Oxford University, 1975.
[17]
George T. Ligler, Surface Properties of Programming Language Constructs, Proc. International Symposium on Proving and Improving Programs, IRIA, 1975, and to appear in Theoretical Computer Science.
[18]
Robert E. Milne, The formal semantics of computer languages and their implementations, Ph.D. Thesis, Cambridge University, 1974.
[19]
Robert E. Milne and Christopher Strachey, A Theory of Programming Language Semantics, research report, Oxford University, 1975.
[20]
Peter Naur, ed., Revised Report on the Algorithmic Language ALGOL 60, Computer Journal, vol. 5, 1963.
[21]
Terrence W. Pratt, Programming Languages: Design and Implementation Prentice-Hall, Englewood Cliffs, N.J., 7-8.
[22]
John C. Reynolds, Presentation at the Symposium on the High Cost of Software, Stanford Research Institute, 1973.
[23]
John C. Reynolds, On the Relation Between Direct and Continuation Semantics, Proc. Second Colloquium on Automata, Languages, and Programming, Saarbrücken, 1974.
[24]
Dana Scott, Outline of a Mathematical Theory of Computation, Proc. Fourth Annual Princeton Conference on Information Sciences and Systems, 1970, 169-176.
[25]
Joseph E. Stoy, The Scott-Strachey Approach to the Mathematical Semantics of Programming Languages, M.I.T. Press, Cambridge, Mass., 1975.
[26]
Christopher Strachey, Fundamental Concepts in Programming Languages, research report, Oxford University, 1970.
[27]
Robert D. Tennent, Mathematical Semantics of Programming Languages, research report, Queen's University, Kingston, Ontario, 1974, and to appear in Communications of the ACM.
[28]
Aad van Wijngaarden et al., eds., Revised Report on the Algorithmic Language ALGOL 68, Acta Informatica, vol. 5, nos. 1-3, 1975.
[29]
Niklaus Wirth, The Programming Language PASCAL, Acta Informatica, vol. 1, no. 1, 1971.
[30]
Niklaus Wirth and C.A.R. Hoare, A Contribution to the Development of ALGOL, Communications of the ACM, vol. 9, no. 6, 1966.
Index Terms
- The assignment axiom and programming language design
Recommendations
Interdisciplinary programming language design
Onward! 2018: Proceedings of the 2018 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and SoftwareApproaches for programming language design used commonly in the research community today center around theoretical and performance-oriented evaluation. Recently, researchers have been considering more approaches to language design, including the use of ...
Experiences with a simple structured programming language
SIGCSE '74: Proceedings of the fourth SIGCSE technical symposium on Computer science educationA great deal of interest has developed in structured programming [Dahl, Dijkstra, and Hoare, 1972] during the past few years. This paper is concerned with some experiences obtained in the use of a structured programming language in the computer science ...
Seven Deadly Sins of Introductory Programming Language Design
SEEP '96: Proceedings of the 1996 International Conference on Software Engineering: Education and Practice (SE:EP '96)We discuss seven undesirable features common to many programming languages used to teach first-time programmers, and illustrate typical pedagogical difficulties which stem from them with examples drawn from the programming languages ABC, Ada, C, C++, ...
Comments
Information & Contributors
Information
Published In
Copyright © 1976 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 20 October 1976
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 390Total Downloads
- Downloads (Last 12 months)35
- Downloads (Last 6 weeks)9
Reflects downloads up to 28 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in