A discipline of programming. Edsger W. Dijkstra

A discipline of programming


A.discipline.of.programming.pdf
ISBN: 013215871X,9780132158718 | 232 pages | 6 Mb


Download A discipline of programming



A discipline of programming Edsger W. Dijkstra
Publisher: Prentice Hall, Inc.




What I write about computer programming applies to other fields of problem solving, such as engineering and mathematics. Http://www.amazon.com/Category-Computer-Scientists-Foundations-Computing/dp/0262660717. Dijkstra - a Discipline of Programming. A perfect programmer knows everything there is to know about everything: this is nirvana: it allows us to solve any problem perfectly. According to Dijkstra's experience, described in chapter "The problem of next permutation" of "A Discipline of Programming", the separation of code and data is essential for clarity. Today, I presented a position paper entitled “Programming Can Deepen Understanding Across Disciplines”. #3 | Written by Jorge Aranda on July 12, 2011. People often use this as an example to show that Dijkstra was excessively doctrinaire, and out of touch with the reality of programming, but usually it's because they don't know what his argument was. Thus, orthogonality is an important mathematical discipline intrinsic to the specification of recursive functions that is naturally applied in functional programming and specification. For further details, see Dijkstra's book "A Discipline of Programming". Http://www.amazon.com/Discipline-Programming-Edsger-W-Dijkstra/dp/013215871X. They are reasonably easy to reproduce and can be debugged using standard methods (code coverage). In the act of creation, you encounter the same tension of raw, boundless possibility against disciplined construction. More than a parellel, programming began to change my way of looking at poetry. The technology itself would be useless if human creativity is not included in its application. Dijkstra introduces a function called wp for "weakest precondition". I wrote a response, explaining where Dijkstra was coming from, and I am very happy with how it . This captures the essence of pairing as far as I'm concerned – it is a discipline of “programming out loud”. Still, if the only problems were deterministic access violations, I could live with them (I'm a very disciplined programmer). Dijkstra talks about this problem in detail in one of my favorite books, "A discipline of programming." Also, here's an article with a surprisingly simple recursive solution: http://nicolas-lara.blogspot.com/2009/01/permutations.