la it la la la en la la la fr en es fr en fr en en en en en en en la la en en la de en la es en la es fr la tr it it it nl la es ru nb fr it la id la la it la la la la es la es ceb es es it la es la it la la zh it la ar bg ca hbs_lat da de en es et fa fi fr lt hbs_lat hu id it ja ko lt en ms nl nb pl pt ro ru ru hbs_lat sv ta tr fy vi zh la it la it ca la la es fr es pt en la
Programmatura ordinata[1] est paradigma programmandi ad claritatem, qualitatem, et tempus evolutionis programmatis computatralis emendandum per latum usum subordinum, structurarum massivarum, et sinuum pro et cum, contra experimenta saltusque simplices adhibendos sicut dictum i-ad,[2] quod ad codicem vermiculatum[3] ducere potest, qui magnum est sequi et tenere.
Orta est notio annis 1960, praecipue in "Go To Statement Considered Harmful," epistula notissima:
Proxima infrenis dicti i-ad usus consecutio est extrema difficultas copiae coordinatorum significantium inveniendae qua progressus rationis describi potest. . . . Dictum i-ad ut videtur est nimis primitivum tantum, nimis occasione ad programma confundenda uti.[4]
Quae rationaliter a theoremate programmatis ordinati, usuque a linguis programmandi ortis sicut ALGOL, commodo multiplicibus structuris moderationis praeditis adiuta est.
Repraesentationes graphicae trium exemplarium primorum per diagrammata NS (caerulea) et cartas fluentes (virides).
Notae[recensere | fontem recensere]
↑ Anglice structured programming.
↑ Anglice spaghetti code.
↑ Anglice: "The unbridled use of the go to statement has as an immediate consequence that it becomes terribly hard to find a meaningful set of coordinates in which to describe the process progress. . . . The go to statement as it stands is just too primitive, it is too much an invitation to make a mess of one's program" (Dijkstra 1968).
Bibliographia[recensere | fontem recensere]
Böhm, Corrado, et G. Jacopini 1966. Flow diagrams, Turing machines and languages with only two formation rules. Communications of the ACM 9(5):366–371. doi:10.1145/355592.365646.
Dahl, Ole-Johan, E. W. Dijkstra, et C. A. R. Hoare. 1972. Structured Programming. Londinii: Academic Press. ISBN 0-12-200550-3.
Darlinton, J., M. Ghanem, et H. W. To. 1993. Structured Parallel Programming. In Programming Models for Massively Parallel Computers. IEEE Computer Society Press.
Dijkstra, Edsger. 1968. Letters to the editor: Go to statement considered harmful. Communications of the ACM 11(3):147–148. doi:10.1145/362929.362947. PDF.
Dijkstra, Edsger. 1970 Notes on Structured Programming, 6. Ed. 2a. Eindhoven: Department of Mathematics, Technical University of Eindhoven.
Jackson, Michael A. 1975. Principles of Program Design. Londinii: Academic Press.
Elder, Matt, Steve Jackson, et Ben Liblit, 2008. Code Sandwiches. No. 1647. University of Wisconsin–Madison. Abstractum. PDF.
Nexus externi[recensere | fontem recensere]
Lege de moderatione in Vicilibris.
BPStruct, instrumentum ad ordinanda systemata concurrentia (programmata, exemplaria rationis), code.google.com
Pages using ISBN magic links
Nomen nondum datum est
Paginam prehendere formá PDF
Novissima mutatio die 5 Februarii 2016 hora 14:22 facta.
Nonobstantibus ceteris condicionibus hunc textum tractare licet secundum "Creative Commons Attribution-ShareAlike License". Vide modos et condiciones.