|
|
 |
| Авторизация |
|
|
|
| Поиск по указателям |
|
|
|
|
|
|
|
 |
|
|
|
| Gries D. — The science of programming |
|
|
|
| Предметный указатель |
Laws, commutative 20
Laws, Contradiction 20 70
Laws, Contradiction, proof of 51
Laws, cor-simplification 79
Laws, De Morgan's 20 70
Laws, distributive 20 69
Laws, Distributivity of Conjunction 110
Laws, Distributivity of Disjunction 111
Laws, Equality 20
Laws, Equality, proof of 51
Laws, Equivalence 19—21
Laws, Excluded Middle 20 70
Laws, Excluded Middle, proof of 50
Laws, Excluded Miracle 110
Laws, identity 21
Laws, Implication 20
Laws, Implication, proof of 51
Laws, Monotonicity 111
Laws, negation 20
Laws, Negation, proof of 50
Laws, or-simplification 21
Laws, or-simplification, proof of 51
Leaf, of a tree 229
Left subtree 229
Length, of a sequence 312
Levin, Gary 302
Lexicographic ordering 217
Line Generator 263
Linear algorithm 321
Linear search 197 206 301
Linear Search Principle 197 301
Link Reversal 215 302 346
List of nodes, inorder 236
List of nodes, postorder 236 347
List of nodes, preorder 232
LOG 314
Logarithm 314 321
Logarithmic algorithm 321
Longest Upsequence 259 303
Loop 139 see
Loop, annotation for 145
Loop, checklist for understanding 145
Loop, iteration of 139
lower 89
lup 259
make-true 116
many-to-one relation 316
MAX 314
Maximum 301
McCarthy, John 295
Mcllroy, Douglas 168
Melville, Robert 303
Meta-theorem 46
Mills, Harlan 302
MIN 314
Misra, J. 303
MOD 314
modus ponens 34
Monotonicity, law of 111
Multiple assignment 121 127
Multiplication, identity of 72
n-ary function 319
n-ary relation 319
Natural deduction system 29—43
Natural number 67 314
Naur, Peter 297 304
Negation 9—10
Negation, law of 20
Nelson, Edward 302
Newton, Isaac 243
Next Higher Permutation 178 262 301 342
Node Count 231 302
Node, of a tree 229
Non-Crooks 353 264
Nondeterminism 111
Nondeterminism, bounded 312
Nondeterminism, restriction of 238
Nondeterminism, unbounded 312
Nondeterministic command 111
Nonterminal symbol 304
Normal form, conjunctive 27
Normal form, disjunctive 27
NOT see "Negation"
Null selector 96
Numerical quantification 73—74
O'Donnell, Michael 42
Odd 314
One-to-many relation 316
One-to-one relation 316
Onto relation 316
OR see "Disjunction"
Or, exlusive 11
Or, inclusive 11
or-simplification 21
Order f(n) 321
Order of execution time 321
ordered 94 126
Oriented binary tree 229
Outline of a proof 104
Output assertion 100
Pairwise disjoint 159
Paradox 21
PARAMETER 150
Parameter, final value of 155
Parameter, initial value of 155
Parameter, result 151
Parameter, specification for 150
Parameter, value 151
Parameter, value result 151
Parameter, var 158
Partial correctness 109—110
Partial relation 316
Partition 214 302 345
pdis 159
Perfect number 85
Period of a Decimal Expansion 264
Perm 91
Perm to Code 263 270 303
Permutation 75
Placement of assertions 278
Plateau of an array 203
Plateau problem 203 206 301
Postcondition 100 109
Postcondition, strongest 120
Postorder 347
Postorder list 347
Postorder traversal 236 347
precedence rules 12 67
Precondition 100 109
Precondition, weakest 109
Predicate 66—87
Predicate calculus 66
Predicate transformer 109
Predicate weakening 195
Predicate, evaluation of 67—68
Premise 29
Preorder 233
Preorder list 232
preorder traversal 232
Prime number 83
Problems, An Exercise Attributed to Hamming 243 302
Problems, Approximating the Square Root 195 201 246 350
Problems, Array Reversal 214 302
Problems, Binary Search 205 302 344
Problems, Closing the Curve 166 301
Problems, Code to Perm 264 272—273 303
Problems, Coffee Can 301 165
Problems, Controlled Density Sort 247 303
Problems, Decimal to Base B 215 302
Problems, Decimal to Binary 215 302
| Problems, Different Adjacent Subsequences 262 303
Problems, Dutch National Flag 214 302
Problems, Efficient Queues in LISP 250 303
Problems, Exponentiation 239 252 302
Problems, Finding Sums of Squares 245 302 348
Problems, Four-tuple Sort 185 239 301
Problems, gcd 191 224—225 301 343
Problems, Insertion Sort 247
Problems, Line Generator 263
Problems, Linear Search 197 206 301
Problems, Link Reversal 215 302 346
Problems, Longest Upsequence 259 303
Problems, Maximum 301
Problems, Next Higher Permutation 178 262 301 342
Problems, Node Count 231 302
Problems, Non-Crooks 353 264
Problems, Partition 214 302 345
Problems, Period of a Decimal Expansion 264
Problems, Perm to Code 263 270 303
Problems, Plateau Problem 203 206 301
Problems, Quicksort 226 302
Problems, Railroad Shunting Yard 219
Problems, Right-Justifying Lines 253 289—293 303
Problems, Saddleback Search 215 302 346
Problems, Searching a Two-Dimensional Array 182 188 301
Problems, Swap 103 119
Problems, Swapping Equal-Length Sections 212 302
Problems, Swapping Sections 222 302
Problems, Tardy Bus 59
Problems, Unique 5-bit Sequences 262 303 352
Problems, Welfare Crook 207 238 302
Procedure 149—162
Procedure, argument of a call 152
Procedure, body of 150—151
Procedure, call of 152
Procedure, declaration of 150
Procedure, heading of 282
Procedure, recursive 217
Production 304
Program inversion 267
Program transformation 235
Program, annotated 104
Programming-in-the-small 168
proof 163
Proof by contradiction 39—41
Proof in natural deduction system 31—32 41—42
Proof outline 104
Proof versus test-case analysis 165
Proportional to 321
Proposition 8—16
Proposition as a set of states 15
Proposition, constant 10
Proposition, equivalent 19
Proposition, evaluation of 11—14
Proposition, stronger 16
Proposition, syntax of 8—9 13
Proposition, weaker 16
Proposition, well-defined 11
Propositional calculus 25
Quadratic algorithm 321
Quantification 71—74
Quantification, implicit 83—84
Quantification, numerical 73—74
Quantification, universal 73
Quantified identifier 71
Quantified identifier, range of 71 74 82
Quantified identifier, type of 83
Quantifier, existential 71
QUEUE 313
Quicksort 226 302
Quine, W.V.O. 42
QWERTY programmer 170
Railroad Shunting Yard 219
Randell, Brian 296
Range of quantified identifier 71 74 82
Record 92 98
Record as a function 92 98
Recursive procedure 221
Ref 159
Refinement, of data 235
Relation 315
Relation, binary 315
Relation, closure of 317
Relation, composition of 316
Relation, identity relation 316
Relation, invariant see "Invariant"
Relation, many-to-one 316
Relation, n-ary 319
Relation, one-to-many 316
Relation, one-to-one 316
Relation, onto 316
Relation, partial 316
Relation, total 316
Rene Descartes 315
Replacing a constant 199
Restricting nondeterminism 238
Result assertion 100
Result parameter 151
Rewriting rule 304
Right subtree 229
Right-Justifying Lines 253 289—293 303
Role of semicolon 115
Root, of a tree 229
Ross, Doug 296
Routine 149
Rule see "Inference rule"
Rule of elimination 30
Rule of inference 25
Rule of introduction 30
Rule of substitution 22 26 46—47
Rule of Transitivity 23 26
Rule, rewriting 304
Saddleback Search 215 302 346
Schema 19 31 45
Scholten, Carel 301
Scope rule in Algol 60 38 78
Scope rule in natural deduction system 38
Scope rule in predicates 78
Searching a Two-Dimensional Array 182 188 301
Section of an array 93
Section, empty section 93
Seegmueller, Gerhard 296
SELECT statement 134
Selector 96
Semicolon, role of 115
Sentence, of a grammar 305
Separation of concerns 237
SEQUENCE 312
Sequence, catenation of 312
Sequence, length of 312
Sequential composition 114—115
Set 310
Set, cardinality of 311
Set, difference 311
Set, empty 310
Set, intersection 311
Set, union 311
Side effects 119
Simple assignment 117
Simple variable 117
Simultaneous substitution 81
skip 114
sp 120
Specification of a parameter 150
STACK 313
State 11
Strategy for developing a loop 181 187
Strategy for developing an alternative command 174
Strength reduction 241
Stronger proposition 16
|
|
|
| Реклама |
|
|
|
|
|
О проекте