√лавна€    Ex Libris     ниги    ∆урналы    —татьи    —ерии     аталог    Wanted    «агрузка    ’удЋит    —правка    ѕоиск по индексам    ѕоиск    ‘орум   
blank
јвторизаци€

       
blank
ѕоиск по указател€м

blank
blank
blank
 расота
blank
McGettrick A.D. Ч The Definition of Programming Languages
McGettrick A.D. Ч The Definition of Programming Languages



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



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


Ќазвание: The Definition of Programming Languages

јвтор: McGettrick A.D.

јннотаци€:

The subject matter of this book evolved from a desire which I had to learn and understand two of the relatively recent developments in computer science and what motivated them. The first relates to the definition of the programming language ALGOL 68, the second to the work of Dana Scott and the late Christopher Strachey in Oxford and their development of mathematical or denotational semantics. The common theme is, of course, the definition of programming languages.


язык: en

–убрика: Computer science/

—татус предметного указател€: √отов указатель с номерами страниц

ed2k: ed2k stats

√од издани€: 1980

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

ƒобавлена в каталог: 06.02.2014

ќперации: ѕоложить на полку | —копировать ссылку дл€ форума | —копировать ID
blank
ѕредметный указатель
$\lambda$      123
$\lambda$-calculus      212Ч218 220
$\lambda$-expression      213Ч218 220 253
$\lambda$-notation      64Ч67 212Ч218 220 257
$\mathcal{M}$      211 234Ч236
$\mathscr{C}$      211Ч212 230Ч231 234Ч236
$\mathscr{E}$      211 231 234Ч236
$\mu$ operator      115Ч122 128
$\mu_{0}$ operator      114Ч115 122 128Ч129
<-control-state->      107Ч111
<-interpretation-state->      107Ч111
<-machine-state->      107Ч111
<-program->      107Ч111
<-program-state->      107Ч108 111
<-translation-state->      110Ч111
a posteriori mode      194
a priori mode      194
Abrahams, P.W.      257
Abstract machine      98Ч99 123Ч126 242Ч243
Abstract program/syntax/form/tree      59 96 99Ч109 112 118 121Ч131 233 241 258
Abstraction      213 252
Accept state      24Ч25
Accuracy (of numbers)      2 4 41
action      22 146 152 204
Ada      245 260
Addyman, A.M.      258
Affix grammar      247 260
Aho, A.V.      255
Alagic, S.      258
Alber, K.      258
ALGOL 60 (Revised)      4 30 42Ч61 69Ч72 95 138 175Ч178 183 219 227Ч228 233 237 240Ч242 247 251Ч257 260
ALGOL 68      5 15 50 53 71Ч72 127 147 156 175Ч209 219 236Ч241 249 253 255 258Ч260
ALGOL W      5 71Ч83 178 183Ч184 201 240 253 255 257
Aliasing      173
Allison, D.C.S.      259
Alphabet      8
alternative      186
Ambiguity      18Ч19 28Ч29 44Ч45 54 59Ч60 71 157 177 189Ч190 197 212 218 242 256
Anderson, R.B.      258
ANSI (American National Standards Institute)      31 38 84 92 97Ч98 256Ч258
Antecedent      166Ч167
Applicability clause      2
Application      212Ч219 228
apply      68
Approximation (relation)      220Ч227
Arbib, M.A.      258
ASA (American Standards Association)      31
Ashcroft, E.A.      258
assertion      160Ч165
Assignment axiom/rule      166
Assignment statement/assignation      32 76 93Ч94 104 108Ч109 112 118 123 155Ч156 165 169 192Ч194 197Ч200 229 235
Association list      68
Atkinson, R.      258
Atoms/atomic symbols      61Ч64
Attribute      76 80 96 105 123 125 139Ч160 183 198Ч199 205 240 247
Attribute directory      125 130
Attribute grammar      139 142Ч153 249 255 258
Attribute occurrence      144Ч148
Attribute translation grammar      146 152
Attribute, inherited      141Ч160 183 198 205 240
Attribute, synthesized      140Ч160 183 205 240
Axiom      166Ч169 174
Axiomatic approach/semantics      159Ч174 206 242 244 249 253 255 258Ч259
Back substitution      162Ч165
Backtracking      20 23 26
Backus Ч Naur form      see "BNF"
Backus, J.      30 43 256
Barnes, J.G.P.      260
BASIC      5 71 91Ч94 247 252 255 257
Bauer, H.      257
Becker, S.      257
Bjorner, D.      260
Block activation      124Ч129
BNF (Backus Ч Naur Form)      42Ч53 57 59 66 69 87Ч88 93 99 100 112 139 153 183Ч184 210 233 239 246 251 260
Bochmann, G.V.      255 258
Boom, H.      259
Bottom element      222Ч224
Bound/bound variable      65 212Ч214
Brainerd, W.      256
Brewer, R.      258
Burnett-Hill, D.G.      258
CAR      63Ч66
Cardinality      219
Case statement      169 203
CDR      63Ч66
Chain      222
Chaplin, R.I.      256
Characteristic condition      115
Characteristic set      115
Chomsky hierarchy      11Ч12 191
Chomsky, N.      11 191
Church Ч Rosser      216
Church, A.      216
Circularity      147Ч149
Clarke, P.A.      256
clauses      87Ч89
Cleaveland, J.C.      206 259
Clint, M.      258
CLU      258
COBOL      5 71 83Ч91 240 246 252 255 257
CODASYL      84
Codomain      210 212
Coercion      183 192Ч196 229 239
Command      211Ч212 229Ч233
Command continuation      230Ч234
Comments/commentary      57
Compiler writer      2 4 19 33 41Ч45 152 191 252
Compiler-compiler      153 260
Compiler/compilation      3 4 14Ч15 19 30 43Ч44 53Ч54 57 59 69Ч71 86Ч91 97 99 147 152Ч153 175Ч177 180Ч182 204Ч205 208 228 240Ч244 247Ч249 256 259
Complementary definitions      2
Complete lattice      221
Components (global, local, state)      115Ч118 124Ч136
Composite domain      224
Composite object      113Ч120
Composite selector      114Ч136
Concatenation      11 101
Concatenation rule      166
Concrete form      99
Concrete program/syntax      59 96 100Ч107 112 121Ч122 241
Conditional      64 108Ч109 156Ч157 169 233Ч235
Conform      33 41 87 92Ч93 98 100
Cons      63Ч66
Consequence rules      167
Consequent      166Ч167
Consistent substitution      75 80 188Ч192 208
Constructor operator      114
Contents      228
Context-free      11Ч12 19 28Ч29 43 73 138Ч139 142Ч153 159 190Ч191 205 247Ч249 258
Context-sensitive      11 27Ч28 47 53 87Ч89 99 103 105 152 190 196Ч199 205 229 240Ч241 247Ч248 252
continuations      229Ч235 244 260
Continuations, command      230Ч234
Continuations, expression      230Ч235
continuous      221Ч227 238
Control component/part      124 126 129Ч136
correctness      2 3 161Ч174
Correspondence      252Ч253
Crosbie, R.E.      256
Curried      213Ч232
Dangling else      58 177
Day, A.C.      256
De Morgan, R.M.      60 256 258
Define-program      109Ч110
Definition by substitution      55 81 251Ч252
Denotable values      227Ч228 234
Denotation directory      125 130
Denotational approach/semantics      209Ч239 242Ч244 249 253 255 259Ч260
Dependency set      148
Dependent      115
Deproceduring      193Ч194
Dereferencing      194Ч195
Derivation      9 12Ч13
Derivation tree      12 13 139 149
Designator      104 109 241
Dijkstra, E.W.      244 258
Directed set      222
Directory attribute      125 130
Directory denotation      125 130
Discriminated union      226
Do statement      32Ч36 39Ч40
Domain      210Ч212 220Ч236
Domain equation      226
Domain, composite      224
Domain, primitive      223Ч224
Domain, semantic      211Ч212 218 223Ч225 233
Donahue, J.E.      258
Dot-notation in LISP      62
Dummy variable      65
Dump component/part      124Ч136
Dynamic semantics      53Ч54 205
Dynamic syntax      248Ч249 260
Efficiency      31 34Ч41 69 71 96Ч97 172Ч178
Elementary objects      113Ч115
Elgot, C.C.      96 257
Empty string/symbol      17Ч18 22
Enhancement modules      92
Enumeration of trees      102
environ      198Ч203
Environment      123Ч129 143 153Ч159 175 178 180Ч183 198Ч200 205Ч208 227Ч235 244 247Ч248
Environment, necessary      127
Environment, standard      175 178 180Ч183 198 200
Epilogue component/part      124 126 129Ч136
eq      64Ч69
Equivalent grammars      12
Errors      82 92Ч93
Euclid      172 258
Euler      247 260
eval      68
EVALQUOTE      67Ч68
Eve, J.      72 257
exception      82 92Ч93
Execute-assignment-statement      108
Execute-if-statement      109
Expression      45 76Ч80 92Ч94 134 139Ч140 154 201Ч203 211 229Ч236
Expression continuation      230Ч235
Extended range      36 39
Factorisation      48
Files      91
Final predicate      160Ч165
Findlay, W.      258
Finite choice grammar      12 27
Finite state machine      28 48
Firm position      194
Fisker, R.G.      259
Fixed point      217Ч218 226
Fleck, M.      258
FORM      66Ч67
Formal proof      165Ч167
Formalism      59Ч60
FORTRAN 4      30Ч42 50 52 59 87 95 240Ч246 251Ч252 255Ч256
FORTRAN 4, FORTRAN 66      30Ч40 59 240Ч243 251Ч252 256
FORTRAN 4, FORTRAN 77      31 38Ч42 240Ч243 251 256
Foster, J.M.      255
Free/free variable      65 212Ч214
Functional processing modules      85Ч91
Functionality      228Ч235
GEDANKEN      233
Generic term      88
Ginsburg, S.      260
Global component      124Ч136
Goldmann, H.      258
GOTO statement      32 36 39 54 157 170
Graham, S.      257
Grammar      5Ч29 73Ч80
Grammar form      249
Grammar transformation      21Ч23 26Ч27
Grammar, affix      247 260
Grammar, attribute      139Ч153 249 255 258
Grammar, attribute translation      146 152
Grammar, LL      20Ч23 26Ч29 153 256
Grammar, LR      23Ч29 153 251 256
Grammar, s-      17
Grammar, two-level (van Wijngaarden)      72 189Ч208 247 255 259
Graphical representation of syntax      49Ч53 256 259
Griffiths, M.      256
Guttag, J.V.      258
Hanford, D.V.      260
Hansen, W.J.      259
Hardware representation      59 179 259
Hay, J.L.      256
Heising, W.P.      31 256
Heliard, J.C.      260
Herriot, J.G.      256
High-level syntax/parse      101 105Ч106
Hill, D.      256
Hill, I.D.      56 60 256
Hoare, C.A.R.      50 71 138 139 160 257Ч259
Hopcroft, J.E.      256
Horning, J.J.      256 258
Hursley      96Ч98 252
Hyper-rule      189 199
Hyperalternative      189
Hypernotion      189Ч190
Hypothetical computer      203Ч204
IBM      95 111
Ichbiah, J.D.      245 260
IFIP      42 71 175 179 182
Immediate derivation      9
Imperative statement      88Ч90
Implementation/implementor      2 4 17Ч18 33 41 58Ч61 64 70 87 90Ч94 97Ч100 123 209 242Ч245 252 260
Implied bracketing      45 78 201 241
Improper element      223
Inconsistent      218Ч220 227 243 249
Inconsistent element      222
Inductive assertion      163
Inductive expression      165
Inference rule      166Ч167
Informal proof      161Ч167
Inherently ambiguous      19 28
Inherited attributes      141Ч160 183 198 205 240
Initial predicate      160Ч165
Injection      225
Inner language/syntax      241Ч242 252Ч253 260
Input predicate/variable      160Ч165
Input/Output      39Ч41 59Ч60 81 92 94Ч95 100 107 111 181Ч182 206 229 234 243
Inspection      225
Interchangeability      2 37 41 53 178Ч180
Intermediate-Range Committee      84
International Business Machines      95 111
International Federation for Information Processing      42 71 175 179 182
Interpretation-phase      110Ч111
Interpreter      61 66Ч70 97Ч100 107Ч112 123 129Ч136 203Ч204 242Ч243 247
Invariant      163 167
Irreducible      216
Irregularities      4 34Ч37 173
Jackson, M.A.      257
Jackson, M.I.      258
Jensen, K.      258
Johnston, S.C.      255
Jones, C.B.      260
Joslin, D.A.      258
Jump      36 157 170 173 203 235
Kemeny, J.G.      91
Knuth, D.E.      256 258
Koster, C.H.A.      53 259 260
Kreig-Brueckner, B.      260
Kurtz, T.C.      91 257
Label      65Ч68
Lambda expression      213Ч218 220 253
Lambda notation      64Ч67 212Ч218 220 257
Lampson, B.W.      258
1 2 3
blank
–еклама
blank
blank
HR
@Mail.ru
       © Ёлектронна€ библиотека попечительского совета мехмата ћ√”, 2004-2020
Ёлектронна€ библиотека мехмата ћ√” | Valid HTML 4.01! | Valid CSS! ќ проекте