000			01894nam a2200229 a 4500
003			AR-sfUTN
008			170717b ||||| |||| 00| 0 d
020			_a013215871X
040			_cAR-sfUTN
041			_aeng
080			_a681.32 D570 _22000
100	1		_aDijkstra, Edsger W. _d1930-2002
245	1	2	_aA discipline of programming / _cEdsger W. Dijkstra.
260			_aNew Jersey: _bPrentice Hall, _c1976
300			_a217 p.
336			_2rdacontent _atexto _btxt
337			_2rdamedia _asin mediación _bn
338			_2rdacarrier _avolumen _bnc
505	8	0	_aCONTENIDO FOREWORD ix PREFACE xiii 0. EXECUTIONAL ABSTRACTION 1 1. THE ROLE OF PROGRAMMING LANGUAGES 7 2. STATES AND THEIR CHARACTERIZATION 10 3. THE CHARACTERIZATION OF SEMANTICS 15 4. THE SEMANTIC CHARACTERIZATION OF A PROGRAMMING LANGUAGE 24 5. TWO THEOREMS 37 6. ON THE DESIGN OF PROPERLY TERMINATING CONSTRUCTS 41 7. EUCLID'S ALGORITHM REVISITED 45 8. THE FORMAL TREATMENT OF SOME SMALL EXAMPLES 51 9. ON NONDETERMINACY BEING BOUNDED 72 10. AN ESSAY ON THE NOTION: THE SCOPE OF VARIABLES 79 11. ARRAY VARIABLES 94 12. THE LINEAR SEARCH THEOREM 105 13. THE PROBLEM OF THE NEXT PERMUTATION 107 14. THE PROBLEM OF THE DUTCH NATIONAL FLAG 111 15. UPDATING A SEQUENTIAL FILE 117 16. MERGING PROBLEMS REVISITED 123 17. AN EXERCISE ATTRIBUTED TO R. W. HAMMING 129 18. THE PATTERN MATCHING PROBLEM 135 19. WRITING A NUMBER AS THE SUM OF TWO SQUARES 140 20. THE PROBLEM OF THE SMALLEST PRIME FACTOR OF A LARGE NUMBER 143 21. THE PROBLEM OF THE MOST ISOLATED VILLAGES 149 22. THE PROBLEM OF THE SHORTEST SUBSPANNING TREE 154 23. REM'S ALGORITHM FOR THE RECORDING OF EQUIVALENCE CLASSES 161 24. THE PROBLEM OF THE CONVEX HULL IN THREE DIMENSIONS 168 25. FINDING THE MAXIMAL STRONG COMPONENTS IN A DIRECTED GRAPH 192 26. ON MANUALS AND IMPLEMENTATIONS 201 27. IN RETROSPECT 209
942			_cLIB _2udc
999			_c60590 _d60590