The new math of computer programming
- 1 January 1975
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 18 (1) , 43-48
- https://doi.org/10.1145/360569.360659
Abstract
Structured programming has proved to be an important methodology for systematic program design and development. Structured programs are identified as compound function expressions in the algebra of functions. The algebraic properties of these function expressions permit the reformulation (expansion as well as reduction) of a nested subexpression independently of its environment, thus modeling what is known as stepwise program refinement as well as program execution. Finally, structured programming is characterized in terms of the selection and solution of certain elementary equations defined in the algebra of functions. These solutions can be given in general formulas, each involving a single parameter, which display the entire freedom available in creating correct structured programs.Keywords
This publication has 6 references indexed in Scilit:
- Analysis of structured programsJournal of Computer and System Sciences, 1974
- An axiomatic basis for computer programmingCommunications of the ACM, 1969
- A constructive approach to the problem of program correctnessBIT Numerical Mathematics, 1968
- Böhm and Jacopini's reduction of flow chartsCommunications of the ACM, 1967
- Flow diagrams, turing machines and languages with only two formation rulesCommunications of the ACM, 1966
- Numerical inverting of matrices of high orderBulletin of the American Mathematical Society, 1947