5 ms·
Dijkstra also challenged the sloppiness of traditional mathematicians frequently in his EWDs. His proof format is extremely readable, and each proof is a comple
by User23 8y ago
Dijkstra also challenged the sloppiness of traditional mathematicians frequently in his EWDs. His proof format is extremely readable, and each proof is a complete manipulable mathematical object, with the steps tied together by implication, consequence, or equivalence and the validity of the step documented.
- zeth___ 8y agoCould you provide a link or citation where he does an expose no it? I am interested.
- User23 8y agohttps://www.cs.utexas.edu/users/EWD/transcriptions/EWD10xx/EWD1073.html https://www.cs.utexas.edu/users/EWD/transcriptions/EWD10xx/E... is an example. That site has many others. Predicate Calculus and Program Semantics is a book that is based on the technique.
- geoalchimista 8y agoI found one more example in this TeX StackExchange question [1]. It's incredibly elegant. But the problem is that it does not seem to be easily reproducible in LaTeX because writing nested lists is such an unnecessary pain (take a look at the adopted answer). Need a package to popularize this style. [1] https://tex.stackexchange.com/questions/49416/which-packages-practices-are-relevant-for-writing-structured-derivations-simil/438750 https://tex.stackexchange.com/questions/49416/which-packages...