Ãëàâíàÿ    Ex Libris    Êíèãè    Æóðíàëû    Ñòàòüè    Ñåðèè    Êàòàëîã    Wanted    Çàãðóçêà    ÕóäËèò    Ñïðàâêà    Ïîèñê ïî èíäåêñàì    Ïîèñê    Ôîðóì   
blank
Àâòîðèçàöèÿ

       
blank
Ïîèñê ïî óêàçàòåëÿì

blank
blank
blank
Êðàñîòà
blank
Scott M.L. — Programming Language Pragmatics
Scott M.L. — Programming Language Pragmatics



Îáñóäèòå êíèãó íà íàó÷íîì ôîðóìå



Íàøëè îïå÷àòêó?
Âûäåëèòå åå ìûøêîé è íàæìèòå Ctrl+Enter


Íàçâàíèå: Programming Language Pragmatics

Àâòîð: Scott M.L.

Àííîòàöèÿ:

Programming Language Pragmatics addresses the fundamental principles at work in the most important contemporary languages, highlights the critical relationship between language design and language implementation, and devotes special attention to issues of importance to the expert programmer. Thanks to its rigorous but accessible teaching style, you’ll emerge better prepared to choose the best language for particular projects, to make more effective use of languages you already know, and to learn new languages quickly and completely.


ßçûê: en

Ðóáðèêà: Computer science/

Ñòàòóñ ïðåäìåòíîãî óêàçàòåëÿ: Ãîòîâ óêàçàòåëü ñ íîìåðàìè ñòðàíèö

ed2k: ed2k stats

Ãîä èçäàíèÿ: 1999

Êîëè÷åñòâî ñòðàíèö: 856

Äîáàâëåíà â êàòàëîã: 16.11.2009

Îïåðàöèè: Ïîëîæèòü íà ïîëêó | Ñêîïèðîâàòü ññûëêó äëÿ ôîðóìà | Ñêîïèðîâàòü ID
blank
Ïðåäìåòíûé óêàçàòåëü
Postcondition of subroutine      167 168
Postfix notation      199 200 251
PostScript      14 199 251 407 793
PowerPC architecture, BCD operations      211
PowerPC architecture, CISC-ish approach      243
PowerPC architecture, condition codes      217
PowerPC architecture, condition-determining delay      245
PowerPC architecture, enumeration-controlled loop      284
PowerPC architecture, GNU back end      500
PowerPC architecture, IBM compiler      496
PowerPC architecture, load_linked and store_conditional (LL/SC) instructions      689—690
PowerPC architecture, SMPs      670
Powerset (in mathematics)      613
pragma      47—48 422 441 466
Pragmatics      xviii (see also “Implementation”)
Pre-test loop      294
Precedence      38
Precedence, context-free grammar      168
Precedence, lambda calculus      615
Precedence, macros      301—302
Precedence, normal-order evaluation      302
Precedence, ordering within expressions and      262
Precedence, parsing      18 38
Precedence, rules      252—253
Precondition of subroutine      167 168
Predefined object      42 118 368
Predefined type      322
Predicate calculus      590 641—642 643—644 646
Predicate in logic      641
Predicate in logic programming      624
Predictive (LL) parsing      48 49 50 51—57 62—75
preemption      662 665 683 685—686
Prefix notation      251 312
Prefix property of CFL      94
Preprocessor      11 12 14 301
Pretty printer      14
primitive type      322
Princeton University      792
Procedure      427 (see also “Subroutine”)
Process      670 682
Processor partitioning      683
Processor status register      208 217
Processor, architecture      203
Processor, architecture evolution      218—227
Processor, implementation      203
Processor, machine language and      203
Processor, pipelined      206
Processor, workstation macro-architecture      204
Production of CFG      35
Profiler      15
Program counter      208
Program maintenance      2
Programmable applications      9
Programmable editor      9
programming environment      14—15
Programming language genealogy      788
PROLOG      625—641
Prolog as logic language      6
Prolog as special purpose language      3
Prolog, arithmetic      629
Prolog, backtracking      630 631 635—637 649 704
Prolog, binding      648
Prolog, control flow      634—637
Prolog, database manipulation      637—641
Prolog, described      793
Prolog, execution order      629—632 634—637
Prolog, imperative features      589
Prolog, implementation      13 14 625 629—632
Prolog, infinite regression      632 656
Prolog, late binding      13—14
Prolog, lists      628—629
Prolog, negation      633 635
Prolog, parallelization      704
Prolog, recursive types      402
Prolog, resolution and unification      626—628
Prolog, self-representation      10 637
Prolog, the cut (!)      634—637 646
Prolog, tic-tac-toe example      632—634 639
Prolog, type checking      625
PROLOG, unification      346
Prolog, wide use of      590
Prologue of subroutine      111 431
PROMISE      303
Proof, constructive vs. nonconstructive      591
Proper list      347 402
Proposition in predicate calculus      641
Pseudo-random number      271
Pseudoassembler notation      225—227
Pseudoinstruction      511
Pthreads      672
Public member of object      533
Pumping lemma      102
Push-down automaton (PDA)      39 87 92—93
PVM (parallel virtual machine), MPI vs.      672
PVM (parallel virtual machine), naming communication partners      706
PVM (parallel virtual machine), receive operation      714
PVM (parallel virtual machine), send operation      711
QLISP      731
Quadruples      497
Qualified identifier      184
Quantifier, existential      641 642 644—645 647
Quantifier, predicate calculus      641
Quantifier, universal      641 642 645
Quasiparallelism      670
Query in Prolog      625
Quicksort      647 653
Quine, Willard van Orman      251
Quiring, Sam B.      72 103
R-value      184 255 389
Rabin, Michael O.      102
Race condition      662 685
Ramesh, S.      730
Randell, Brian      489
Random number, pseudo      271
Random-access file      406
Range of function      612
Rational type      324
Rau, B. Ramakrishna      786
Reaching definition      745 755 755—756 775
read-eval-print loop      594
Read-modify-write instruction      see “Atomic operation primitive”
Read-write dependence (anti-dependence)      231 760
Reader-writer lock      690
Ready list      684—687 692—694 721 725
receive operation      714—719
receive operation, explicit      714—719
receive operation, implicit      673—674 679—680 714 719 720
receive operation, selective      714—719
Record (structure)      see “Variant record (union)”
Record (structure) with statement      355—358
Record (structure), alternate terms      351
Record (structure), described      327
Record (structure), holes      353—355
Record (structure), memory layout      353—355
Record (structure), symbol table      133
Record (structure), syntax and operations      351—353
Recursion      297—303
Recursion in functional programming language      250 590
Recursion, applicative- and normal-order evaluation      301—303
Recursion, described      249
Recursion, iteration and      297—301
Recursion, Smalltalk      580
Recursive descent parsing      51—57 186 470—471
Recursive type      382
Recursive type, pointers      328
Recursive type, reference model of variables      384—386
Recursive type, value model of variables      386—389
Reduced instruction set computer      see “RISC (reduced instruction set computer)”
Reentrant code      692
Reentrant thread scheduler      692—694
Reference count      394 396—397
Reference model of variables, assignment      255—256 258 384
Reference model of variables, class declaration      534
Reference model of variables, constructor function and      547 550—551
Reference model of variables, initialization      258
Reference model of variables, parameter passing      444—446
Reference model of variables, recursive type      382 384—386
Referencing environment      106
Referencing environment, binding rules      106 116 139—144 678
Referential transparency      254 622
Register addressing mode      216
Register allocation      234—241 441 504—507 760 775—778 786
Register indirect addressing mode      216 221 226 237
Register interference graph      776 111
Register pressure      735
Register spilling      234
Register Transfer Language (RTL)      499—503 527
Register windows      240—241
Register, 680x0 vs. MIPS architecture      221—224
Register, cache vs.      208—209
Register, compiler management      207
Register, pseudoassembler notation      226
Register, RISC machine      208
Register, virtual      492 735
Register-memory architecture      215
Register-register architecture      215 234
Regular expression      32 33—34
Regular language      32 87
Regular set      see “Regular language”
Relocatable object file      507 509—510 516
Relocation      509 514 515—516
Relocation table      509
Remainder in integer division      421
Remote Procedure Call (RPC)      672—673 719—722
Remote procedure call (RPC), implementation      720—722
Remote procedure call (RPC), implicit receipt      673—674 679 714
Remote procedure call (RPC), message dispatcher      721
Remote procedure call (RPC), semantics      719—720
Remote procedure call (RPC), stub      672 719 721
Remote procedure call (RPC), transparency      719—720
Rendezvous      719
REPEAT loop      see “Loop logically-controlled”
Repeated inheritance, mix-in      557 565 573—574 576
Repeated inheritance, replicated      570—571
Repeated inheritance, shared      555 570 572—573
Replicated inheritance      570—571
Report-generating system      9
Reps, Thomas      202
Reserved word      41
Resolution in logic programming      624
Reuse, modules and module type      531
Reuse, object-oriented programming and      531
Reverse Polish (postfix) notation      199 200 251
Rice, H. Gordon      102
Right-most derivation      37
RISC (Reduced Instruction Set Computer)      see “Alpha architecture” “MIPS “PA-RISC “PowerPC “Sparc
RISC (reduced instruction set computer), addressing modes      216 221
RISC (reduced instruction set computer), assembler      513
RISC (reduced instruction set computer), byte operations      211
RISC (reduced instruction set computer), CISC vs.      215 220—225 242—243
RISC (reduced instruction set computer), commercial architectures      242
RISC (reduced instruction set computer), compilation for      227
RISC (reduced instruction set computer), computational instructions      215
RISC (reduced instruction set computer), condition codes      217
RISC (reduced instruction set computer), conditional branches      217
RISC (reduced instruction set computer), delayed branch      232
RISC (reduced instruction set computer), delayed load      232
RISC (reduced instruction set computer), described      204
RISC (reduced instruction set computer), endian-ness      210
RISC (reduced instruction set computer), history and evolution      211 219—230 232 243
RISC (reduced instruction set computer), instructions      224—225
RISC (reduced instruction set computer), load-store (register-register) architecture      215 234
RISC (reduced instruction set computer), multiplication and division      228
RISC (reduced instruction set computer), nullifying branches      233
RISC (reduced instruction set computer), philosophy of      219 242
RISC (reduced instruction set computer), pipeline      206
RISC (reduced instruction set computer), registers      208 221—224
RISC (reduced instruction set computer), relocation      514
RISC (reduced instruction set computer), subroutine call      215
RISC (reduced instruction set computer), three-address instructions      215
Ritchie, Dennis M.      789
Robinson, J. Alan      657
Rosenkrantz, Daniel J.      102 202
Rosser, J. Barclay      617
Rounds, William C.      202
Roussel, Philippe      657 793
Row-major order (for array layout)      373 622 768
Row-pointer layout for arrays      374
RPC      see “Remote procedure call”
RPG      9
RTF (Microsoft Rich Text Format)      407
RTL (GNU Register Transfer Language)      499—503 527
Rubin, Frank      316
Rule in Prolog      625
Russell, Lawford J.      489
S-DSM (software distributed shared memory)      317 672 731
S-expression      501 600
Sanity check on file system      474—476
Sather      489
SC (store_conditional) instruction      689—670 726
Scalar type      325
Scaled addressing mode      216
Scanner generator      41 46 87 94
Scanners and scanning      16—17 32 40—48
Scatter operation      714 719
Scheduler-based synchronization      671 694—703
Scheduler-based synchronization, conditional critical region      700—703
Scheduler-based synchronization, monitor      696—700
Scheduler-based synchronization, scheduler implementation      692—694
Scheduler-based synchronization, semaphore      695—696 697
Scheduling      see “Instruction scheduling”
Scheduling, coroutine      683
Scheduling, coscheduling (gang scheduling)      682
Scheduling, multiprocessor      686—687
Scheduling, RPC      721
Scheduling, scheduler implementation      692—694
Scheduling, self-scheduling      775
Scheduling, uniprocessor      683—685
Scheme      594—604 (see also “Lisp”)
Scheme, assignment      599—600
Scheme, bindings      596—597
Scheme, Boolean constants      598
Scheme, continuations      270 472
Scheme, control flow      599—600
Scheme, described      793
Scheme, DFA example      603—604
Scheme, equality      598
Scheme, imperative features      592
Scheme, interpreter      594—595
Scheme, lambda expression      595—596
Scheme, lazy evaluation      302
Scheme, lists      597—598 600—603
Scheme, macros      606
Scheme, numbers      597—598
Scheme, polymorphism      147
Scheme, scope rules      122 129 597
Scheme, self-representation      116 600
Scheme, side effect      599
Schiffman, Alan M.      586
Schneider, Fred B.      730
Schorr, H.      399 426
Schroeder, Michael      731
Schwartz, Jacob T.      786
Scope      see “Scope rules”
Scope of a binding      115—116
scope resolution operator      121 149 534 538 568
Scope rules      115—139
Scope rules for classes      542—544
Scope rules, association list      137—139
Scope rules, central reference table      139
1 2 3 4 5 6 7 8 9 10 11 12 13 14
blank
Ðåêëàìà
blank
blank
HR
@Mail.ru
       © Ýëåêòðîííàÿ áèáëèîòåêà ïîïå÷èòåëüñêîãî ñîâåòà ìåõìàòà ÌÃÓ, 2004-2024
Ýëåêòðîííàÿ áèáëèîòåêà ìåõìàòà ÌÃÓ | Valid HTML 4.01! | Valid CSS! Î ïðîåêòå