Trace: Tennessee Research and Creative Exchange

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.

[1]  Edsger W. Dijkstra,et al.  A constructive approach to the problem of program correctness , 1968 .

[2]  Herman H. Goldstine.  The Computer from Pascal to von Neumann , 1972 .

[3]  Niklaus Wirth.  Systematic Programming: An Introduction , 1973 .

[4]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .

[5]  Stanley Gill.  The philosophy of programming , 1960 .

[6]  H. Maurer.  Computation: Finite and infinite machines, by Marvin Minsky. Englewood Cliffs, N. J., Prentice Hall, xvii + 317 pages . $12.00. , 1968, Canadian Mathematical Bulletin.

[7]  Alston S. Householder,et al.  The Theory of Matrices in Numerical Analysis , 1964 .

[8]  J. H. Wilkinson.  The algebraic eigenvalue problem , 1966 .

[9]  Zohar Manna,et al.  The Translation of 'Go To' Programs to 'While' Programs , 1971, IFIP Congress.

[10]  S. Rao Kosaraju,et al.  Analysis of structured programs , 1973, STOC.

[11]  Maurice V. Wilkes.  Automatic Digital Computers , 1958 .

[12]  David C. Cooper,et al.  Böhm and Jacopini's reduction of flow charts , 1967, CACM.

[13]  Donald E. Knuth.  A review of Structured Programming. , 1973 .

[14]  Allen Newell,et al.  Human Problem Solving. , 1973 .

[15]  P. Henrici.  Discrete Variable Methods in Ordinary Differential Equations , 1962 .

[16]  J. Neumann,et al.  Numerical inverting of matrices of high order , 1947 .

[17]  C. A. R. HOARE,et al.  An axiomatic basis for computer programming , 1969, CACM.

[18]  Corrado Böhm,et al.  Flow diagrams, turing machines and languages with only two formation rules , 1966, CACM.

[19]  John McCarthy,et al.  A basis for a mathematical theory of computation, preliminary report , 1899, IRE-AIEE-ACM '61 (Western).