Programming language pragmatics:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam [u.a.]
Elsevier, Morgan Kaufmann
2016
|
| Ausgabe: | 4. ed. |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XXXII, 956 S. graph. Darst. |
| ISBN: | 9780124104099 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV042607883 | ||
| 003 | DE-604 | ||
| 005 | 20210715 | ||
| 007 | t | ||
| 008 | 150610s2016 d||| |||| 00||| eng d | ||
| 020 | |a 9780124104099 |9 978-0-12-410409-9 | ||
| 035 | |a (OCoLC)954006468 | ||
| 035 | |a (DE-599)BVBBV042607883 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-473 |a DE-92 |a DE-703 |a DE-706 |a DE-739 | ||
| 050 | 0 | |a QA76.7 | |
| 082 | 0 | |a 005.13 |2 21 | |
| 084 | |a ST 240 |0 (DE-625)143625: |2 rvk | ||
| 084 | |a ST 240 |0 (DE-625)143625: |2 rvk | ||
| 100 | 1 | |a Scott, Michael Lee |d 1959- |e Verfasser |0 (DE-588)131591398 |4 aut | |
| 245 | 1 | 0 | |a Programming language pragmatics |c Michael L. Scott |
| 250 | |a 4. ed. | ||
| 264 | 1 | |a Amsterdam [u.a.] |b Elsevier, Morgan Kaufmann |c 2016 | |
| 300 | |a XXXII, 956 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Programming languages (Electronic computers) | |
| 650 | 0 | 7 | |a Programmiersprache |0 (DE-588)4047409-4 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4123623-3 |a Lehrbuch |2 gnd-content | |
| 689 | 0 | 0 | |a Programmiersprache |0 (DE-588)4047409-4 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |m Digitalisierung UB Passau - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028040814&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-028040814 | ||
Datensatz im Suchindex
| _version_ | 1804174778116866048 |
|---|---|
| adam_text | Contents Foreword xxiii Preface xxv FOUNDATIONS 1 Introduction з 5 і. I The Art of Language Design 7 1.2 The Programming Language Spectrum II 1.3 Why Study Programming Languages? 14 1.4 Compilation and Interpretation 17 1.5 Programming Environments 24 1.6 An Overview of Compilation 26 1.6.1 Lexical and Syntax Analysis 28 1.6.2 Semantic Analysis and Intermediate Code Generation 32 1.6.3 Target Code Generation 34 1.6.4 Code Improvement 36 1.7 Summary and Concluding Remarks 37 1.8 Exercises 38 1.9 Explorations 39 1.10 Bibliographic Notes 2 Programming Language Syntax 2.1 Specifying Syntax: Regular Expressions and Context-Free Grammars 40 43 44 2.1.1 Tokens and Regular Expressions 2.1.2 Context-Free Grammars 45 48 2.1.3 Derivations and Parse Trees 50
x xi Contents Contents 54 2.2 Scanning 2.2.1 Generating a Finite Automaton 3.5 The Meaning of Names within a Scope 145 56 3.5.1 Aliases 145 2.2.2 Scanner Code 6! 3.5.2 Overloading 147 2.2.3 Table-Driven Scanning 65 2.2.4 Lexical Errors 65 2.2.5 Pragmas 67 2.3 Parsing 2.3.1 Recursive Descent 2.3.2 Writing an LL( 1 ) Grammar 153 157 73 3.6.4 Lambda Expressions 159 79 2.3.4 Bottom-Up Parsing 89 2.4.1 Finite Automata 2.4.2 Push-Down Automata 2.4.3 Grammar and Language Classes 152 Subroutine Closures 69 82 2.4 Theoretical Foundations 3.6.1 3.6.2 First-Class Values and Unlimited Extent 3.6.3 Object Closures 2.3.3 Table-Driven Top-Down Parsing 2.3.5 Syntax Errors 3.6 The Binding of Referencing Environments C-l • 102 C-13 • 103 155 3.7 Macro Expansion 3.8 Separate Compilation 3.8.1 Separate Compilation in C 3.8.2 Packages and Automatic Header Inference 3.8.3 Module Hierarchies 162 C-36 • 165 C-37 C-40 C-41 C-13 3.9 Summary and Concluding Remarks C-l 8 C-l 9 165 3.10 Exercises 167 2.5 Summary and Concluding Remarks 104 3.11 Explorations 175 2.6 Exercises 105 3.12 Bibliographic Notes 177 2.7 Explorations 112 2.8 Bibliographic Notes N2 Semantic Analysis 179 4.1 The Role of the Semantic Analyzer 180 115 4.2 Attribute Grammars 184 3.1 The Notion of Binding Time 116 4.3 Evaluating Attributes 187 3.2 Object Lifetime and Storage Management 4.4 Action Routines 195 Static Allocation 118 119 3.2,2 Stack-Based Allocation 120 3.2.3 Heap-Based Allocation 122 124 Names, Scopes, and Bindings 3.2.1 3,2.4 Garbage Collection 125 3.3 Scope Rules 3.3.1 Static Scoping 3.3.2 Nested Subroutines 126 127
3.3.3 Declaration Order 130 3.3.4 Modules 3.3.5 Module Types and Classes 135 139 3.3.6 Dynamic Scoping 142 3.4 Implementing Scope 3.4.1 Symbol Tables 3.4.2 Association Lists and Central Reference Tables C-26 • 144 4.5 Space Management for Attributes 4.5.1 Bottom-Up Evaluation C-45 4.5.2 Top-Down Evaluation C-50 • 200 C-45 4.6 Tree Grammars and Syntax Tree Decoration 201 4.7 Summary and Concluding Remarks 208 4.8 Exercises 209 4.9 Explorations 214 4.10 Bibliographic Notes Target Machine Architecture 215 C-60 C-26 5.1 The Memory Hierarchy C-61 C-31 5.2 Data Representation C-63 • 217
xii Contents Contents 5.2.1 Integer Arithmetic 5.2.2 Floating-Point Arithmetic 5.3 Instruction Set Architecture (ISA) 5.3.1 Addressing Modes 5.3.2 Conditions and Branches 5.4 Architecture and Implementation 5.4.1 5.4.2 5.4.3 5.4.4 5.4.5 Microprogramming Microprocessors RISC Multithreading and Multicore Two Example Architectures: The x86 and ARM 5.5 Compiling for Modern Processors 5.5.1 Keeping the Pipeline Full 5.5.2 Register Allocation C-67 C-70 C-71 C-72 C-77 C-77 282 C-110 · 283 6.8 Summary and Concluding Remarks 284 6.9 Exercises 286 6.11 Bibliographic Notes 294 7 Type Systems 7.1 Overview 7.1.1 7.1.2 7.1.3 7.1.4 221 7.2.1 Type Equivalence 7.2.2 Type Compatibility 7.2.3 Type Inference 7.2.4 Type Checking inML 224 226 229 The Meaning of Type” Polymorphism Orthogonality Classification of Types 7.2 Type Checking 223 7.3 Parametric Polymorphism 7.3.1 Generic Subroutines and Classes 7.3.2 Generics in C++, Java, and C# 238 240 297 298 300 302 302 305 312 313 320 324 326 331 333 c-119 · 339 243 7.4 Equality Testing and Assignment 340 246 7.5 Summary and Concluding Remarks 342 7.6 Exercises 344 7.7 Explorations 347 7.8 Bibliographic Notes 348 247 250 252 6.4 Selection 253 254 256 8 Composite Types 8.1 6.5 Iteration 277 C-93 6.3 Sequencing 6.4.1 Short-Circuited Conditions 6.4.2 Case/Switch Statements 277 292 C-105 6.2.1 Structured Alternatives to goto 6.2.2 Continuations 275 6.10 Explorations 5.9 Bibliographic Notes 6.2 Structured and Unstructured Flow · 274 C-89 C-104 Precedence and Associativity Assignments Initialization Ordering within Expressions Short-Circuit Evaluation
268 C-107 C-88 5.8 Explorations 6.1.1 6.1.2 6.1.3 6.1.4 6.1.5 266 C-80 C-100 Expression Evaluation 6.7 Nondeterminacy C-78 5.7 Exercises 6.1 262 6.6.1 Iteration and Recursion 6.6.2 Applicative- and Normal-Order Evaluation C-76 C-98 6 Control Flow Enumeration-Controlled Loops Combination Loops Iterators Generators in Icon Logically Controlled Loops 6.6 Recursion C-75 5.6 Summary and Concluding Remarks CORE ISSUES IN LANGUAGE DESIGN 6.5.1 6.5.2 6.5.3 6.5.4 6.5.5 C-65 xiii 261 Records (Structures) 351 351
xiv Contents Contents 8.1.1 Syntax and Operations 8.1.2 Memory Layout and its Impact 8.1.3 Variant Records (Unions) 353 8.2 Arrays 8.2.1 Syntax and Operations 8.2.2 Dimensions, Bounds, and Allocation 8.2.3 Memory Layout · 357 9.5 Coroutines 450 9.5.1 9.5.2 9.5.3 9.5.4 453 368 375 8.4 Sets 376 8.5 Pointers and Recursive Types 377 8.7 Files and Input/Output 8.7.1 Interactive I/O 8.7.2 File-Based I/O 8.7.3 Text I/O C-148 462 398 9.9 Explorations 467 * 401 10.1 8.10 Explorations 409 8.11 410 Displays Stack Case Studies: LLVM on ARM; gcc on x86 Register Windows In-Line Expansion 4M 412 414 C-163 C-167 C-177 9.3 Parameter Passing 9.3.1 9.3.2 9.3.3 9.3.4 Parameter Modes Call by Name Special-Purpose Parameters Function Returns 9.4 Exception Handling · 417 · 417 · 419 419 422 423 C-180 9.10 Bibliographic Notes 10 Data Abstraction and Object Orientation 404 9.2.1 9.2.2 9.2.3 9.2.4 456 9.8 Exercises 8.9 Exercises 9.2 Calling Sequences 456 456 389 402 Review of Stack Layout · · 461 8.8 Summary and Concluding Remarks 9.1 C-183 C-187 9.7 Summary and Concluding Remarks · 388 C-I5I 9 Subroutines and Control Abstraction 9.6 Events 454 457 C-148 C-149 Bibliographic Notes Stack Allocation Transfer Implementation of Iterators Discrete Event Simulation 9.6.1 Sequential Handlers 9.6.2 Thread-Based Handlers 378 8.6 Lists 445 447 359 363 C-144 444 359 8.3 Strings 8.5.1 Syntax and Operations 8.5.2 Dangling References 8.5.3 Garbage Collection 9.4.1 Defining Exceptions 9.4.2 Exception Propagation 9.4.3 Implementation of Exceptions 352 C-136 XV · 433 433 438 440 459 468 471 Object-Oriented Programming
473 10.1.1 481 Classes and Generics 10.2 Encapsulation and Inheritance 10.2.1 Modules 10.2.2 Classes 10.2.3 Nesting (Inner Classes) 10.2.4 Type Extensions 10.2.5 Extending without Inheritance 10.3 Initialization and Finalization 10.3.1 10.3.2 10.3.3 10.3.4 Choosing a Constructor References and Values Execution Order Garbage Collection 10.4 Dynamic Method Binding 10.4.1 10.4.2 10.4.3 10.4.4 Virtual and Nonvirtual Methods Abstract Classes Member Lookup Object Closures 10.5 Mix-In Inheritance 10.5.1 Implementation 10.5.2 Extensions 485 486 488 490 491 494 495 496 498 502 504 505 508 508 509 513 516 517 519
xvi xvii Contents Contents 10.6 True Multiple Inheritance 10.6.1 Semantic Ambiguities 10.6.2 Replicated Inheritance 10.6.3 Shared Inheritance C-194 · 1 1.7.2 Control Flow 1 1.7.3 Structures 521 C-196 C-200 C-217 C-219 11.8 Functional Programming in Perspective 581 11.9 Summary and Concluding Remarks 583 C-201 10.7 Object-Oriented Programming Revisited 522 523 11.10 Exercises 10.8 Summary and Concluding Remarks 524 ll.l 1 Explorations 589 10.9 Exercises 525 11.12 Bibliographic Notes 590 10.7.1 The Object Model of Smalltalk C-204 · 10.10 Explorations 528 10.11 Bibliographic Notes 529 584 12 Logic Languages 12.1 591 592 Logic Programming Concepts 593 12.2 Prolog ALTERNATIVE PROGRAMMING MODELS 533 Functional Languages 11.1 535 Historical Origins 536 11.2 Functional Programming Concepts 537 11.3 A Bit of Scheme 539 1 1 1 1 1 1 1.3.1 1.3.2 1.3.3 1.3.4 1.3.5 1.3.6 Bindings Lists and Numbers Equality Testing and Searching Control Flow and Assignment Programs as Lists Extended Example: DFA Simulation in Scheme 542 1.4.1 1.4.2 1.4.3 1.4.4 1.4.5 1.4.6 547 553 0226 • 612 0227 0228 0230 613 613 613 615 12.6 Exercises 618 12.7 Explorations 620 12.8 Bibliographic Notes 620 569 571 576 C-214 607 555 567 · 600 604 616 565 C-212 598 12.5 Summary and Concluding Remarks 563 11.6 Higher-Order Functions 596 597 554 559 1 1.5.1 Strictness and Lazy Evaluation 1 1.5.2 I/O: Streams and Monads Lambda Calculus 12.4.1 Parts of Logic Not Covered 12.4.2 Execution Order 12.4.3 Negation and the “Closed World” Assumption 550 1 1.5 Evaluation Order Revisited 1 1.7.1 12.4 Logic Programming in Perspective 548
Equality and Ordering Bindings and Lambda Expressions Type Constructors Pattern Matching Control Flow and Side Effects Extended Example: DFA Simulation in OCaml 11.7 Theoretical Foundations 12.3.1 Clausal Form 12.3.2 Limitations 12.3.3 Skolemization 545 595 Resolution and Unification Lists Arithmetic Search/Execution Order Extended Example: Tic-Tac-Toe Imperative Control Flow Database Manipulation 12.3 Theoretical Foundations 543 544 11.4 A Bit of OCaml 1 1 1 1 1 1 12.2.1 12.2.2 12.2.3 12.2.4 12.2.5 12.2.6 12.2.7 580 13 Concurrency 13.1 Background and Motivation 13.1.1 The Case for Multithreaded Programs 13.1.2 Multiprocessor Architecture 13.2 Concurrent Programming Fundamentals 623 624 627 631 635
xviii Contents Contents 13.2.1 13.2.2 13.2.3 13.2.4 Communication and Synchronization Languages and Libraries Thread Creation Syntax Implementation of Threads 637 638 647 13.3 Implementing Synchronization 13.3.1 13.3.2 13.3.3 13.3.4 13.3.5 659 13.5.1 13.5.2 13.5.3 13.5.4 Naming Communication Partners Sending Receiving Remote Procedure Call 14.5 Summary and Concluding Remarks 764 674 14.8 Bibliographic Notes 771 676 679 683 C-235 • A CLOSER LOOK AT IMPLEMENTATION 15 Building a Runnable Program C-235 C-239 775 15.1.1 A Plausible Set of Phases 15.1.2 Phases and Passes C-249 697 15.2 15.2.1 GIMPLE and RTL 15.2.2 Stack-Based Intermediate Forms 15.3 699 776 780 Intermediate Forms 780 C-273 · 782 782 Code Generation 784 15.3.1 An Attribute Grammar Example 15.3.2 Register Allocation 785 787 700 15.4 Address Space Organization 790 701 15.5 Assembly 792 15.5.1 Emitting Instructions 15.5.2 Assigning Addresses to Names 794 704 705 712 717 718 796 15.6 Linking 797 15.6.1 Relocation and Name Resolution 15.6.2 Type Checking 798 799 724 15.7 Dynamic Linking 14.3.1 CGI Scripts 14.3.2 Embedded Server-Side Scripts 775 15.1 Back-End Compiler Structure C-244 13.9 Bibliographic Notes 14.3 Scripting the World Wide Web 773 687 695 Shell (Command) Languages Text Processing and Report Generation Mathematics and Statistics “Glue” Languages and General-Purpose Scripting Extension Languages 751 757 769 13.8 Explorations 14.2.1 14.2.2 14.2.3 14.2.4 14.2.5 739 743 14.7 Explorations 690 14.2 Problem Domains Names and Scopes String and Pattern Manipulation Data Types Object Orientation 765 13.7 Exercises
14.1.1 Common Characteristics 738 14.6 Exercises 688 14.1 What Is a Scripting Language? · 736 669 669 13.6 Summary and Concluding Remarks Scripting Languages 734 C-258 667 Monitors Conditional Critical Regions Synchronization in Java Transactional Memory Implicit Synchronization 13.5 Message Passing 14.4.1 14.4.2 і 4.4.3 14.4.4 653 657 663 734 14.4 Innovative Features 652 Busy-Wait Synchronization Nonblocking Algorithms Memory Consistency Scheduler Implementation Semaphores 13.4 Language-Level Constructs 13.4.1 13.4.2 13.4.3 13.4.4 13.4.5 14.3.3 Client-Side Scripts 14.3.4 Java Applets and Other Embedded Elements 14.3.5 XSLT 635 xix 727 728 729 15.7.1 Position-Independent Code 15.7.2 Fully Dynamic (Lazy) Linking C-279 C-280 C-282 · 800
XX Contents Contents 15.8 Summary and Concluding Remarks 802 15.9 Exercises 803 17.7 Loop Improvement II 17.7.1 Loop Unrolling andSoftware Pipelining 17.7.2 Loop Reordering C-332 C-332 C-337 C-344 15.10 Explorations 805 17.8 Register Allocation 15.11 Bibliographic Notes 806 17.9 Summary and Concluding Run-Time Program Management 807 17.10 Exercises C-349 810 17.11 Explorations C-353 17.12 Bibliographic Notes C-354 16.1 Virtual Machines 16.1.1 The Java Virtual Machine 16.1.2 The Common Language Infrastructure 812 C-286 · 16.2 Late Binding of Machine Code 16.2.1 16.2.2 16.2.3 16.2.4 820 822 Just-in-Time and Dynamic Compilation Binary Translation Binary Rewriting Mobile Code and Sandboxing 822 828 833 837 16.3.1 Reflection 16.3.2 Symbolic Debugging 16.3.3 Performance Analysis 845 16.4 Summary and Concluding Remarks 850 16.5 Exercises 851 16.6 Explorations 853 16.7 Bibliographic Notes 854 837 848 C-297 17.1 Phases of Code Improvement C-299 17.2 Peephole Optimization C-301 17.3 Redundancy Elimination in Basic Blocks C-304 17.3.1 A Running Example 17.3.2 Value Numbering 17.4 Global Redundancy and Data Flow Analysis 17.4.1 SS A Form and Global Value Numbering 17.4.2 Global Common Subexpression Elimination 17.5 Loop Improvement 1 17.5.1 Loop Invariants 17.5.2 Induction Variables 17.6 Instruction Scheduling C-348 A Programming Languages Mentioned 859 В Language Design and Language Implementation 871 C Numbered Examples 877 835 16.3 Inspection/Introspection Code Improvement Remarks XXI C-305 C-307 C-312 C-312 C-315 C-323 C-323 C-325 C-328 · 857 Bibliography 891 Index 911
|
| any_adam_object | 1 |
| author | Scott, Michael Lee 1959- |
| author_GND | (DE-588)131591398 |
| author_facet | Scott, Michael Lee 1959- |
| author_role | aut |
| author_sort | Scott, Michael Lee 1959- |
| author_variant | m l s ml mls |
| building | Verbundindex |
| bvnumber | BV042607883 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.7 |
| callnumber-search | QA76.7 |
| callnumber-sort | QA 276.7 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 240 |
| ctrlnum | (OCoLC)954006468 (DE-599)BVBBV042607883 |
| dewey-full | 005.13 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.13 |
| dewey-search | 005.13 |
| dewey-sort | 15.13 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| edition | 4. ed. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01511nam a2200385 c 4500</leader><controlfield tag="001">BV042607883</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210715 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">150610s2016 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780124104099</subfield><subfield code="9">978-0-12-410409-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)954006468</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042607883</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-739</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.7</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.13</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 240</subfield><subfield code="0">(DE-625)143625:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 240</subfield><subfield code="0">(DE-625)143625:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Scott, Michael Lee</subfield><subfield code="d">1959-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)131591398</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Programming language pragmatics</subfield><subfield code="c">Michael L. Scott</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">4. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam [u.a.]</subfield><subfield code="b">Elsevier, Morgan Kaufmann</subfield><subfield code="c">2016</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXXII, 956 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programming languages (Electronic computers)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmiersprache</subfield><subfield code="0">(DE-588)4047409-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4123623-3</subfield><subfield code="a">Lehrbuch</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Programmiersprache</subfield><subfield code="0">(DE-588)4047409-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau - ADAM Catalogue Enrichment</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028040814&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-028040814</subfield></datafield></record></collection> |
| genre | (DE-588)4123623-3 Lehrbuch gnd-content |
| genre_facet | Lehrbuch |
| id | DE-604.BV042607883 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T07:05:48Z |
| institution | BVB |
| isbn | 9780124104099 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028040814 |
| oclc_num | 954006468 |
| open_access_boolean | |
| owner | DE-29T DE-473 DE-BY-UBG DE-92 DE-703 DE-706 DE-739 |
| owner_facet | DE-29T DE-473 DE-BY-UBG DE-92 DE-703 DE-706 DE-739 |
| physical | XXXII, 956 S. graph. Darst. |
| publishDate | 2016 |
| publishDateSearch | 2016 |
| publishDateSort | 2016 |
| publisher | Elsevier, Morgan Kaufmann |
| record_format | marc |
| spelling | Scott, Michael Lee 1959- Verfasser (DE-588)131591398 aut Programming language pragmatics Michael L. Scott 4. ed. Amsterdam [u.a.] Elsevier, Morgan Kaufmann 2016 XXXII, 956 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Programming languages (Electronic computers) Programmiersprache (DE-588)4047409-4 gnd rswk-swf (DE-588)4123623-3 Lehrbuch gnd-content Programmiersprache (DE-588)4047409-4 s DE-604 Digitalisierung UB Passau - ADAM Catalogue Enrichment application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028040814&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Scott, Michael Lee 1959- Programming language pragmatics Programming languages (Electronic computers) Programmiersprache (DE-588)4047409-4 gnd |
| subject_GND | (DE-588)4047409-4 (DE-588)4123623-3 |
| title | Programming language pragmatics |
| title_auth | Programming language pragmatics |
| title_exact_search | Programming language pragmatics |
| title_full | Programming language pragmatics Michael L. Scott |
| title_fullStr | Programming language pragmatics Michael L. Scott |
| title_full_unstemmed | Programming language pragmatics Michael L. Scott |
| title_short | Programming language pragmatics |
| title_sort | programming language pragmatics |
| topic | Programming languages (Electronic computers) Programmiersprache (DE-588)4047409-4 gnd |
| topic_facet | Programming languages (Electronic computers) Programmiersprache Lehrbuch |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028040814&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT scottmichaellee programminglanguagepragmatics |