|
|
|
|
| LEADER |
02461cam a22006497a 4500 |
| 001 |
BIBLO-22408 |
| 003 |
AR-BaUEN |
| 005 |
20250321150912.0 |
| 008 |
980605s1981 nyu||||f |||| 00| 0|eng|d |
| 040 |
|
|
|a AR-BaUEN
|b spa
|c AR-BaUEN
|
| 020 |
|
|
|a 0387964800
|
| 020 |
|
|
|a 3540964800
|
| 020 |
|
|
|a 9780387964805
|
| 044 |
|
|
|a xxu
|
| 080 |
|
|
|a 681
|
| 100 |
1 |
|
|a Gries, David
|
| 245 |
1 |
4 |
|a The science of programming
|
| 250 |
|
|
|a 1st. ed.
|
| 260 |
|
|
|a New York, NY :
|b Springer,
|c c1981
|
| 300 |
|
|
|a xv, 366 p.
|
| 490 |
0 |
|
|a Texts and monographs in computer science
|
| 505 |
0 |
0 |
|g Chapter 1.
|t Propositions
|
| 505 |
0 |
0 |
|g Chapter 2.
|t Reasoning using Equivalence Transformations
|
| 505 |
0 |
0 |
|g Chapter 3.
|t A Natural Deduction System
|
| 505 |
0 |
0 |
|g Chapter 4.
|t Predicates
|
| 505 |
0 |
0 |
|g Chapter 5.
|t Notation and Conventions for Arrays
|
| 505 |
0 |
0 |
|g Chapter 6.
|t Using Assertions to Document Programs
|
| 505 |
0 |
0 |
|g Chapter 7.
|t The Predicate Transformer wp
|
| 505 |
0 |
0 |
|g Chapter 8.
|t The Commands skip, abort and Composition
|
| 505 |
0 |
0 |
|g Chapter 9.
|t The Assignment Command
|
| 505 |
0 |
0 |
|g Chapter 10.
|t The Alternative Command
|
| 505 |
0 |
0 |
|g Chapter 11.
|t The Iterative Command
|
| 505 |
0 |
0 |
|g Chapter 12.
|t Procedure Call
|
| 505 |
0 |
0 |
|g Chapter 13.
|t Introduction
|
| 505 |
0 |
0 |
|g Chapter 14.
|t Programming as a Goal-Oriented Activity
|
| 505 |
0 |
0 |
|g Chapter 15.
|t Developing Loops from Invariants and Bounds
|
| 505 |
0 |
0 |
|g Chapter 16.
|t Developing Invariants
|
| 505 |
0 |
0 |
|g Chapter 17.
|t Notes on Bound Functions
|
| 505 |
0 |
0 |
|g Chapter 18.
|t Using Iteration Instead of Recursion
|
| 505 |
0 |
0 |
|g Chapter 19.
|t Efficiency Considerations
|
| 505 |
0 |
0 |
|g Chapter 20.
|t Two Larger Examples of Program Development
|
| 505 |
0 |
0 |
|g Chapter 21.
|t Inverting Programs
|
| 505 |
0 |
0 |
|g Chapter 22.
|t Notes on Documentation
|
| 505 |
0 |
0 |
|g Chapter 23.
|t Historical Notes
|
| 505 |
0 |
0 |
|g Appendix 1.
|t Backus-Naur Form
|
| 505 |
0 |
0 |
|g Appendix 2.
|t Sets, Sequences, Integers and Real Numbers
|
| 505 |
0 |
0 |
|g Appendix 3.
|t Relations and Functions
|
| 505 |
0 |
0 |
|g Appendix 4.
|t Asymptotic Execution Time Properties
|
| 505 |
0 |
0 |
|t Answers to Exercises
|
| 505 |
0 |
0 |
|t References
|
| 505 |
0 |
0 |
|t Index
|
| 653 |
1 |
0 |
|a PROGRAMAS DE COMPUTADORAS
|
| 653 |
1 |
0 |
|a SOFTWARE
|
| 653 |
1 |
0 |
|a PROGRAMACION DE COMPUTADORES
|
| 653 |
1 |
0 |
|a TECNICAS DE PROGRAMACION
|
| 931 |
|
|
|a DC
|b ALGORITMOS I
|
| 962 |
|
|
|a info:eu-repo/semantics/book
|a info:ar-repo/semantics/libro
|b info:eu-repo/semantics/publishedVersion
|