Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Gries D. — The science of programming
Gries D. — The science of programming

Читать книгу
бесплатно

Скачать книгу с нашего сайта нельзя

Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: The science of programming

Автор: Gries D.

Аннотация:

This is the very first book to discuss the theory and principles of computer programming on the basis of the idea that a proof of correctness and a program should be developed hand in hand. It is built around the method first proposed by Dijkstra in his monograph The Discipline of Programming (1976), involving a "calculus for the derivation of programs." Directing his materials to the computer programmer with at least one year of experience, Gries presents explicit principles behind program development, and then leads the reader through example programs using those principles. Propositions and predicate calculus are presented as a took for the programmer, rather than simply an object of study. The reader should come away with a fresh outlook on programming theory and practice, and the assurance to develop correct programs effectively.


Язык: en

Рубрика: Computer science/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 1981

Количество страниц: 379

Добавлена в каталог: 05.02.2014

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
abort      114
abs      314
Abstraction      149
Addition      314
Addition, identity of      72
Aho, A.V.      309
Allen, Layman E.      42 59
Alternative command      132
Alternative command, strategy for developing      174
Ambiguity      308
An Exercise Attributed to Hamming      243 302
AND      see "Conjunction"
and-simplification      21
Annotated program      104
Annotation for a loop      145
Antecedent      9
Approximating the Square Root      195 201 246 350
Argument      152
Argument, final value of      155
Argument, initial value of      155
Array      88
Array as a function      89
Array of arrays      96
Array picture      93
array reversal      214 302
Array section      93
Array, domain of      89
Array, two-dimensional      96
assertion      2 100
Assertion, output      100
Assertion, placement of      278
Assertion, result      100
Assignment, simple      117
Assignment, simple, forward rule for      120
Assignment, simple, multiple assignment      121 127
Assignment, simple, to an array element      124 90
Associative laws      20 69
Associative laws, proof of      48
Associativity of composition      316
Atomic expression      67
Axiom      25
Backus — Naur form      304
Backus, John      304
Balloon theory      193
Bauer, F.L.      296
bb      132
Binary relation      315
Binary search      205 302 344
Binary tree      229
BNF      304
BNF, extensions to      309
Body, of a procedure      150—151
Boole, George      8 20
Boolean      8 66
Bound function      142
Bound identifier      76—77
Bound variable substitution      80 85
Bounded nondeterminism      312
Calculus      25
Calculus, predicate calculus      66
Calculus, propositional calculus      25
Call, of a procedure      152
Call, of a procedure, by reference      158
Call, of a procedure, by result      151
Call, of a procedure, by value      151
Call, of a procedure, by value result      151
cand      68—70
cand-simplification      80
Cardinality, of a set      311
Cartesian product      315
Case statement      134
Catenation      75
Catenation of sequences      312
Catenation, identity of      75 333
Ceil      314
Changing a representation      246
chebyshev      83
Checklist for understanding a loop      145
Chomsky, Noam      304
choose      312
Closing the Curve      166 301
Closure, of a relation      317
Closure, of a relation, transitive      317
Code to Perm      264 272—273 303
Code, for a permutation      270
Coffee Can Problem      165 301
Combining pre- and postconditions      211
Command      108
Command, abort      114
Command, alternative command      132
Command, assignment to an array element      124
Command, assignment, multiple      121 127
Command, assignment, simple      128
Command, Choose      312
Command, deterministic      111
Command, guarded command      131
Command, iterative command      139
Command, nondeterministic      111
Command, procedure call      164
Command, sequential composition      114—115
Command, skip      114
Command-comment      99 279
Command-comment, indentation of      279
Common sense and formality      164
Commutative laws      20
Commutative laws, proof of      48
Composition, associativity of      316
Composition, of relations      316
Composition, sequential      114—115
Concatenation      see "Catenation"
Conclusion      29
Conjecture, disproving      15
Conjunct      9
Conjunction      9—10
Conjunction, distributivity of      110
Conjunction, identity of      72
Conjunctive normal form      27
Consequent      9
Constable, Robert      42
Constant proposition      10
Constant-time algorithm      321
Contradiction, law of      20 70
Contradiction, proof by      39—41
Controlled Density Sort      247 303
Cor      68—70
cor-simplification      79
Correctness, partial      109—110
Correctness, total      110
Counting nodes of a tree      231
Cubic algorithm      321
Cut point      297
Data encapsulation      235
Data refinement      235
De Morgan's laws      20 70
De Morgan's laws, proof of      49
de Morgan, Augustus      20
Debugging      5
Decimal to Base B      215 302
Decimal to Binary      215 302
Declaration, of a procedure      150
Deduction Theorem      36
Definition, of variables      283
Deleting a conjunct      195
Demers, Alan      302
Depth, of a tree      236
Derivation      308
Derived inference rule      46
Derived inference rule, rule of Substitution      46—47
Determinism      111
Deterministic command      111
Difference, of two sets      311
Different Adjacent Subsequences      262 303
Dijkstra, E.W.      295—296 300—303
Dis      159
Disjoint vectors      159
Disjoint, pairwise      159
Disjunct      9
Disjunction      9—10
Disjunction, distributivity of      111
Disjunction, identity of      72
Disjunctive normal form      27
Distributive laws      20 69
Distributive laws, proof of      48
Distributivity of Conjunction      110
Distributivity of Disjunction      111
Divide and conquer      226
DO      138—139
Domain      89 117
domain, of an array      89
domain, of an expression      117
Dutch National Flag      214 302
Dynamic programming      261
Efficient Queues in LISP      250 303
Eliminating an Implication      24
Elimination, rule of      30
Empty section      93
Empty set      310
Empty tree      229
Enlarging the range of a variable      206
Equality      9—10
Equality, law of      20
Equals      see "Equality"
EQUIVALENCE      19
Equivalence, laws of      19—21
Equivalent propositions      19
Euclid      301
Even      314
Excluded middle, law of      20 70
Excluded Miracle, law of      110
Exclusive OR      11
Existential quantification      71
Exponential algorithm      321
exponentiation      239 252 302
Expression, atomic      67
Expression, domain of      117
f      8
Factorial function      221
Feijen, W.H.J.      264 302
Fibonacci number      225
Final value, of a variable      102
Final value, of a variable of an argument      155
Finding Sums of Squares      245 302 348
Flaw chart      138 190—191
Flaw chart, disadvantages of      375
FLOOR      314
Floyd, Robert      297
Formality and common sense      164
Forward rule for assignment      120
Four-tuple Sort      185 239 301
Free identifier      76—77
Function      318
Function of an Identifier      318
Function, bound function      142
Function, n-ary function      319
Function, variant function      142
GCD      191 224—225 301 343
Gentzen, Gerhard      42
Gill, Stanley      296
Global reference      38
Grammar      305
Grammar, ambiguous      308
Grammar, sentence of      305
Grammar, unambiguous      308
Greatest common divisor      see "gcd"
Griffiths, Michael      301
guard      131
Guarded command      131
Halving an interval      202
Hamming, R.W.      302
Heading, of a procedure      282
Hoare, C.A.R.      295 297—299 302
Hopcroft, J.E.      309
Horner's rule      242
Horner, W.G.      243
Identifier      9
Identifier, bound      76—77
Identifier, free      76—77
Identifier, quantified      71
Identifier, quantified, range of      82
Identifier, quantified, type of      83
Identifier, restriction on      76
Identity element      72
Identity relation      316
Identity, law of      21
Identity, of addition      72
Identity, of and      72
Identity, of catanation      75 333
Identity, of multiplication      72
Identity, of or      72
if      132
IFIP      295 300
IMP      see "Implication"
Implementation of a tree      230
Implication      9—10
Implication, elimination of      24
Implication, law of      20
Implicit quantification      83—84
Inclusive or      11
Indentation      375
Indentation of command-comments      279
Indentation of delimiters      279
Inference rule      25 30
Inference rule, $\lor-E$      33 43
Inference rule, $\lor-I$      31 43
Inference rule, $\mathbf{A}-E$      84
Inference rule, $\mathbf{A}-I$      84
Inference rule, $\mathbf{E}-E$      85
Inference rule, $\mathbf{E}-I$      84
Inference rule, $\Rightarrow -E$      33 43
Inference rule, $\Rightarrow -I$      36 43
Inference rule, $\urcorner -E$      40 43
Inference rule, $\urcorner -I$      40 43
Inference rule, =-E      34 43
Inference rule, =-I      34 43
Inference rule, bound variable substitution      85
Inference rule, derived      46
Inference rule, ^-E      31 43
Inference rule, ^-I      30—31 43
Initial value of a variable      102
Initial value of an argument      155
Inorder traversal      236
InRange      125
Insertion sort      247
INTEGER      67 314
Integer set      67
Intersection, of two sets      311
Introduction, rule of      30
Invariant      141
Invariant relation      see "Invariant"
inversion      185—186
Inverting Programs      267
Iteration      139
Iterative command      139
Iterative command, strategy for developing      181 187
Ithacating      31
Knuth, Donald      302
Laws, and-simplification      21
Laws, and-simplification, proof of      51
Laws, associative      20 69
Laws, cand-simplification      80
1 2 3
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2017
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте