Structure-Oriented Programming
作者： Michael Jackson
DOI: 10.1007/978-3-642-46490-4_17
关键词: Procedural programming 、 Computer science 、 Notation 、 Declarative programming 、 Tree (data structure) 、 Directed graph 、 Programming language 、 Goto 、 Symbolic programming 、 Inductive programming
摘要: The two programs ‘skip’ and ‘abort’ (in Dijkstra’s notation) have no structure: they are atomic, therefore parts to be brought into a relationship by program structure. All other An ‘unstructured program’, consisting of assignment, goto, input/output statements, some labelled, has at least the structure directed graph. A ‘structured program’ in conventional sense hierarchy or, perhaps, tree. question then is not whether our will we like it or not. rather: what should have? And, course, how compose structures?
springer.com
springerlink.com参考文章(8)
K. Mani Chandy, Raymond Tzuu-Yau Yeh, Current trends in programming methodology Prentice-Hall. ,(1977)
John V. Guttag, David R. Musser, Ellis Horowitz, The design of data type specifications international conference on software engineering. pp. 414- 420 ,(1976) , 10.5555/800253.807714
R. M. Burstall, John Darlington, Some transformations for developing recursive programs ACM SIGPLAN Notices. ,vol. 10, pp. 465- 472 ,(1975) , 10.1145/390016.808470
M. A. Jackson, Principles of program design ,(1975)
Edsger Wybe Dijkstra, A Discipline of Programming ,(1976)
W. Morven Gentleman, Message passing between sequential processes: The reply primitive and the administrator concept Software - Practice and Experience. ,vol. 11, pp. 435- 466 ,(1981) , 10.1002/SPE.4380110504
C. A. R. Hoare, E. W. Dijkstra, O. J. Dahl, Structured Programming ,(1972)
Tony Hoare, Communicating Sequential Processes ,(1985)