Programming language concepts:
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
London [u.a.]
Springer
2012
|
| Schriftenreihe: | Undergraduate topics in computer science
|
| Schlagwörter: | |
| Links: | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=025147162&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| Umfang: | XIV, 278 S. graph. Darst. |
| ISBN: | 9781447141556 1447141555 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV040292000 | ||
| 003 | DE-604 | ||
| 005 | 20161123 | ||
| 007 | t| | ||
| 008 | 120704s2012 xx d||| |||| 00||| eng d | ||
| 020 | |a 9781447141556 |9 978-1-4471-4155-6 | ||
| 020 | |a 1447141555 |9 1-4471-4155-5 | ||
| 035 | |a (OCoLC)802559221 | ||
| 035 | |a (DE-599)BSZ363981160 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-20 |a DE-29T |a DE-473 | ||
| 082 | 0 | |a 005.13 | |
| 084 | |a ST 140 |0 (DE-625)143592: |2 rvk | ||
| 084 | |a ST 240 |0 (DE-625)143625: |2 rvk | ||
| 100 | 1 | |a Sestoft, Peter |d 1962- |e Verfasser |0 (DE-588)131473476 |4 aut | |
| 245 | 1 | 0 | |a Programming language concepts |c Peter Sestoft |
| 264 | 1 | |a London [u.a.] |b Springer |c 2012 | |
| 300 | |a XIV, 278 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Undergraduate topics in computer science | |
| 650 | 0 | 7 | |a Programmierung |0 (DE-588)4076370-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programmiersprache |0 (DE-588)4047409-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Formale Sprache |0 (DE-588)4017848-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programmierparadigma |0 (DE-588)4308224-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |0 (DE-588)1071861417 |a Konferenzschrift |y 2006 |z Wien |2 gnd-content | |
| 689 | 0 | 0 | |a Programmiersprache |0 (DE-588)4047409-4 |D s |
| 689 | 0 | 1 | |a Programmierparadigma |0 (DE-588)4308224-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Informatik |0 (DE-588)4026894-9 |D s |
| 689 | 1 | 1 | |a Programmierung |0 (DE-588)4076370-5 |D s |
| 689 | 1 | 2 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 689 | 2 | 0 | |a Formale Sprache |0 (DE-588)4017848-1 |D s |
| 689 | 2 | |8 3\p |5 DE-604 | |
| 856 | 4 | 2 | |m Digitalisierung UB Bamberg - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=025147162&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-025147162 | |
Datensatz im Suchindex
| _version_ | 1819244460129648640 |
|---|---|
| adam_text | Contents
1 Introduction........................................................... 1
1.1 Files for This Chapter............................................ 1
1.2 Meta Language and Object Language................................. 1
1.3 A Simple Language of Expressions.................................. 2
1.3.1 Expressions Without Variables .......................... 2
1.3.2 Expressions with Variables................................. 3
1.4 Syntax and Semantics.............................................. 4
1.5 Representing Expressions by Objects............................... 5
1.6 The History of Programming Languages.............................. 7
1.7 Exercises......................................................... 9
References............................................................ 12
2 Interpreters and Compilers............................................. 13
2.1 Files for This Chapter........................................... 13
2.2 Interpreters and Compilers....................................... 13
2.3 Scope and Bound and Free Variables............................... 14
2.3.1 Expressions with Let-Bindings and Static Scope.......... 15
2.3.2 Closed Expressions........................................ 16
2.3.3 The Set of Free Variables............................... 16
2.3.4 Substitution: Replacing Variables by Expressions ....... 17
2.4 Integer Addresses Instead of Names............................... 19
2.5 Stack Machines for Expression Evaluation......................... 21
2.6 Postscript, a Stack-Based Language............................... 22
2.7 Compiling Expressions to Stack Machine Code...................... 24
2.8 Implementing an Abstract Machine in Java......................... 25
2.9 History and Literature........................................... 26
2.10 Exercises........................................................ 27
References............................................................ 29
3 From Concrete Syntax to Abstract Syntax.............................. 31
3.1 Preparatory Reading.............................................. 31
ix
X
Contents
3.2 Lexers, Parsers, and Generators............................... 32
3.3 Regular Expressions in Lexer Specifications................... 33
3.4 Grammars in Parser Specifications ............................ 34
3.5 Working with F# Modules....................................... 35
3.6 Using fslex and fsyacc........................................ 36
3.6.1 Setting up f si ex and fsyacc for Command Line Use . . 36
3.6.2 Using fslex and fsyacc in Visual Studio............... 37
3.6.3 Parser Specification for Expressions .................. 37
3.6.4 Lexer Specification for Expressions.................... 38
3.6.5 The ExprPar. fsyacc. output File Generated by fsyacc . . . 40
3.6.6 Exercising the Parser Automaton........................ 43
3.6.7 Shift/Reduce Conflicts................................. 45
3.7 Lexer and Parser Specification Examples....................... 46
3.7.1 A Small Functional Language........................... 46
3.7.2 Lexer and Parser Specifications for Micro-SQL......... 47
3.8 A Handwritten Recursive Descent Parser........................ 48
3.9 JavaCC: Lexer-, Parser-, and Tree Generator................... 50
3.10 History and Literature........................................ 52
3.11 Exercises..................................................... 54
References......................................................... 56
4 A First-Order Functional Language.................................. 57
4.1 Files for This Chapter........................................ 57
4.2 Examples and Abstract Syntax ................................. 57
4.3 Run-Time Values: Integers and Closures........................ 59
4.4 A Simple Environment Implementation........................... 59
4.5 Evaluating the Functional Language ........................... 60
4.6 Evaluation Rules for Micro-ML................................. 62
4.7 Static Scope and Dynamic Scope................................ 64
4.8 Type-Checking an Explicitly Typed Language.................... 65
4.9 Type Rules for Monomorphic Types ............................. 68
4.10 Static Typing and Dynamic Typing.............................. 70
4.10.1 Dynamic Typing in Java and C# Array Assignment .... 71
4.10.2 Dynamic Typing in Non-Generic Collection Classes .... 71
4.11 History and Literature........................................ 72
4.12 Exercises..................................................... 73
References......................................................... 76
5 Higher-Order Functions............................................. 77
5.1 Files for This Chapter........................................ 77
5.2 Higher-Order Functions in F#.................................. 77
5.3 Higher-Order Functions in the Mainstream...................... 78
5.3.1 Higher-Order Functions in Java......................... 78
5.3.2 Higher-Order Functions in C#........................... 80
5.3.3 Google MapReduce....................................... 81
5.4 A Higher-Order Functional Language............................ 81
Contents
xi
5.5 Eager and Lazy Evaluation ..................................... 82
5.6 The Lambda Calculus............................................ 83
5.7 History and Literature......................................... 86
5.8 Exercises...................................................... 86
References.......................................................... 91
6 Polymorphic Types................................................... 93
6.1 Files for This Chapter......................................... 93
6.2 ML-Style Polymorphic Types..................................... 93
6.2.1 Informal Explanation of ML Type Inference............... 94
6.2.2 Which Type Parameters May Be Generalized................ 95
6.3 Type Rules for Polymorphic Types............................... 97
6.4 Implementing ML Type Inference................................. 99
6.4.1 Type Equation Solving by Unification....................102
6.4.2 The Union-Find Algorithm................................102
6.4.3 The Complexity of ML-Style Type Inference...............103
6.5 Generic Types in Java and C#...................................104
6.6 Co-Variance and Contra-Variance................................105
6.6.1 Java Wildcards..........................................107
6.6.2 C# Variance Declarations................................108
6.6.3 The Variance Mechanisms of Java and C#..................109
6.7 History and Literature.........................................109
6.8 Exercises......................................................109
References..........................................................113
7 Imperative Languages................................................115
7.1 Files for This Chapter.........................................115
7.2 A Naive Imperative Language....................................115
7.3 Environment and Store..........................................117
7.4 Parameter Passing Mechanisms...................................118
7.5 The C Programming Language.....................................120
7.5.1 Integers, Pointers and Arrays in C......................120
7.5.2 Type Declarations in C .................................122
7.6 The Micro-C Language...........................................123
7.6.1 Interpreting Micro-C....................................125
7.6.2 Example Programs in Micro-C.............................125
7.6.3 Lexer Specification for Micro-C.........................125
7.6.4 Parser Specification for Micro-C .......................128
7.7 Notes on Strachey’s Fundamental Concepts ......................130
7.8 History and Literature.........................................133
7.9 Exercises......................................................133
References..........................................................136
8 Compiling Micro-C...................................................137
8.1 Files for This Chapter.........................................137
8.2 An Abstract Stack Machine......................................138
8.2.1 The State of the Abstract Machine ......................138
Contents
xii
8.2.2 The Abstract Machine Instruction Set..................139
8.2.3 The Symbolic Machine Code.............................140
8.2.4 The Abstract Machine Implemented in Java ..............141
8.2.5 The Abstract Machine Implemented in C..................142
8.3 The Structure of the Stack at Run-Time.........................143
8.4 Compiling Micro-C to Abstract Machine Code.....................144
8.5 Compilation Schemes for Micro-C................................144
8.6 Compilation of Statements......................................146
8.7 Compilation of Expressions.....................................149
8.8 Compilation of Access Expressions..............................149
8.9 Compilation to Real Machine Code...............................150
8.10 History and Literature.........................................150
8.11 Exercises......................................................151
References..........................................................153
9 Real-World Abstract Machines........................................155
9.1 Files for This Chapter.........................................155
9.2 An Overview of Abstract Machines...............................155
9.3 The Java Virtual Machine (JVM).................................157
9.3.1 The JVM Run-Time State..................................157
9.3.2 The JVM Bytecode........................................159
9.3.3 The Contents of JVM Class Files.........................159
9.3.4 Bytecode Verification...................................162
9.4 The Common Language Infrastructure (CLI).......................163
9.5 Generic Types in CLI and JVM...................................165
9.5.1 A Generic Class in Bytecode.............................165
9.5.2 Consequences for Java...................................166
9.6 Decompilers for Java and C#....................................168
9.7 Just-in-Time Compilation.......................................169
9.8 History and Literature.........................................171
9.9 Exercises......................................................171
References..........................................................173
10 Garbage Collection..................................................175
10.1 Files for This Chapter.........................................175
10.2 Predictable Lifetime and Stack Allocation .....................175
10.3 Unpredictable Lifetime and Heap Allocation.....................176
10.4 Allocation in a Heap...........................................177
10.5 Garbage Collection Techniques..................................178
10.5.1 The Heap and the Freelist...............................178
10.5.2 Garbage Collection by Reference Counting................179
10.5.3 Mark-Sweep Collection...................................180
10.5.4 Two-Space Stop-and-Copy Collection .....................181
10.5.5 Generational Garbage Collection.........................182
10.5.6 Conservative Garbage Collection.........................183
10.5.7 Garbage Collectors Used in Existing Systems ............184
Contents
xiii
10.6 Programming with a Garbage Collector...........................185
10.6.1 Memory Leaks.............................................185
10.6.2 Finalizers...............................................186
10.6.3 Calling the Garbage Collector............................186
10.7 Implementing a Garbage Collector in C...........................186
10.7.1 The List-C Language......................................186
10.7.2 The List-C Machine.......................................189
10.7.3 Distinguishing References from Integers.................190
10.7.4 Memory Structures in the Garbage Collector..............191
10.7.5 Actions of the Garbage Collector........................192
10.8 History and Literature..........................................193
10.9 Exercises.......................................................194
References...........................................................198
11 Continuations........................................................201
11.1 Files for This Chapter.........................................201
11.2 Tail-Calls and Tail-Recursive Functions........................201
11.2.1 A Recursive But Not Tail-Recursive Function ............201
11.2.2 A Tail-Recursive Function................................202
11.2.3 Which Calls Are Tail Calls?.............................203
11.3 Continuations and Continuation-Passing Style...................204
11.3.1 Writing a Function in Continuation-Passing Style.........204
11.3.2 Continuations and Accumulating Parameters................205
11.3.3 The CPS Transformation...................................206
11.4 Interpreters in Continuation-Passing Style ....................206
11.4.1 A Continuation-Based Functional Interpreter..............207
11.4.2 Tail Position and Continuation-Based Interpreters........209
11.4.3 A Continuation-Based Imperative Interpreter..............209
11.5 The Frame Stack and Continuations...............................211
11.6 Exception Handling in a Stack Machine...........................211
11.7 Continuations and Tail Calls....................................213
11.8 Callcc: Call with Current Continuation..........................214
11.9 Continuations and Backtracking..................................215
11.9.1 Expressions in Icon......................................215
11.9.2 Using Continuations to Implement Backtracking............216
11.1 OHistory and Literature.........................................218
11.1 lExercises......................................................219
References...........................................................223
12 A Locally Optimizing Compiler........................................225
12.1 Files for This Chapter..........................................225
12.2 Generating Optimized Code Backwards.............................225
12.3 Backwards Compilation Functions.................................226
12.3.1 Optimizing Expression Code While Generating It...........227
12.3.2 The Old Compilation of Jumps.............................229
12.3.3 Optimizing a Jump While Generating It....................230
XIV
Contents
12.3.4 Optimizing Logical Expression Code.....................232
12.3.5 Eliminating Dead Code..................................233
12.3.6 Optimizing Tail Calls..................................234
12.3.7 Remaining Deficiencies of the Generated Code...........237
12.4 Other Optimizations..........................................237
12.5 A Command Line Compiler for Micro-C..........................238
12.6 History and Literature........................................239
12.7 Exercises.....................................................240
References........................................................243
Appendix A Crash Course in F#...........................................245
A. 1 Files for This Chapter........................................245
A.2 Getting Started................................................245
A.3 Expressions, Declarations and Types............................246
A.3.1 Arithmetic and Logical Expressions......................246
A.3.2 String Values and Operators.............................248
A.3.3 Types and Type Errors...................................248
A.3,4 Function Declarations...................................250
A.3.5 Recursive Function Declarations.........................251
A.3.6 Type Constraints........................................251
A.3.7 The Scope of a Binding..................................251
A.4 Pattern Matching...............................................252
A.5 Pairs and Tuples...............................................253
A.6 Lists..........................................................254
A.7 Records and Labels.............................................255
A.8 Raising and Catching Exceptions................................256
A.9 Datatypes......................................................257
A.9.1 The option Datatype ....................................258
A.9.2 Binary Trees Represented by Recursive Datatypes.........259
A.9.3 Curried Functions.......................................260
A. 10 Type Variables and Polymorphic Functions.....................260
A. 10.1 Polymorphic Datatypes................................261
A. 10.2 Type Abbreviations...................................262
A. 11 Higher-Order Functions.......................................263
A. 11.1 Anonymous Functions..................................263
A. 11.2 Higher-Order Functions on Lists......................264
A. 12 F# Mutable References .......................................265
A.13F# Arrays .....................................................266
A. 14 Other F# Features.......................................... 267
A. 15 Exercises....................................................267
References........................................................269
Index
271
|
| any_adam_object | 1 |
| author | Sestoft, Peter 1962- |
| author_GND | (DE-588)131473476 |
| author_facet | Sestoft, Peter 1962- |
| author_role | aut |
| author_sort | Sestoft, Peter 1962- |
| author_variant | p s ps |
| building | Verbundindex |
| bvnumber | BV040292000 |
| classification_rvk | ST 140 ST 240 |
| ctrlnum | (OCoLC)802559221 (DE-599)BSZ363981160 |
| 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 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02367nam a2200553 c 4500</leader><controlfield tag="001">BV040292000</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20161123 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">120704s2012 xx d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781447141556</subfield><subfield code="9">978-1-4471-4155-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1447141555</subfield><subfield code="9">1-4471-4155-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)802559221</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BSZ363981160</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-20</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-473</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.13</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 140</subfield><subfield code="0">(DE-625)143592:</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">Sestoft, Peter</subfield><subfield code="d">1962-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)131473476</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Programming language concepts</subfield><subfield code="c">Peter Sestoft</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">London [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIV, 278 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="490" ind1="0" ind2=" "><subfield code="a">Undergraduate topics in computer science</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Formale Sprache</subfield><subfield code="0">(DE-588)4017848-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmierparadigma</subfield><subfield code="0">(DE-588)4308224-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">2006</subfield><subfield code="z">Wien</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="1"><subfield code="a">Programmierparadigma</subfield><subfield code="0">(DE-588)4308224-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Formale Sprache</subfield><subfield code="0">(DE-588)4017848-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Bamberg - 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=025147162&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-025147162</subfield></datafield></record></collection> |
| genre | 1\p (DE-588)1071861417 Konferenzschrift 2006 Wien gnd-content |
| genre_facet | Konferenzschrift 2006 Wien |
| id | DE-604.BV040292000 |
| illustrated | Illustrated |
| indexdate | 2024-12-20T16:11:46Z |
| institution | BVB |
| isbn | 9781447141556 1447141555 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-025147162 |
| oclc_num | 802559221 |
| open_access_boolean | |
| owner | DE-20 DE-29T DE-473 DE-BY-UBG |
| owner_facet | DE-20 DE-29T DE-473 DE-BY-UBG |
| physical | XIV, 278 S. graph. Darst. |
| publishDate | 2012 |
| publishDateSearch | 2012 |
| publishDateSort | 2012 |
| publisher | Springer |
| record_format | marc |
| series2 | Undergraduate topics in computer science |
| spellingShingle | Sestoft, Peter 1962- Programming language concepts Programmierung (DE-588)4076370-5 gnd Programmiersprache (DE-588)4047409-4 gnd Algorithmus (DE-588)4001183-5 gnd Formale Sprache (DE-588)4017848-1 gnd Programmierparadigma (DE-588)4308224-5 gnd Informatik (DE-588)4026894-9 gnd |
| subject_GND | (DE-588)4076370-5 (DE-588)4047409-4 (DE-588)4001183-5 (DE-588)4017848-1 (DE-588)4308224-5 (DE-588)4026894-9 (DE-588)1071861417 |
| title | Programming language concepts |
| title_auth | Programming language concepts |
| title_exact_search | Programming language concepts |
| title_full | Programming language concepts Peter Sestoft |
| title_fullStr | Programming language concepts Peter Sestoft |
| title_full_unstemmed | Programming language concepts Peter Sestoft |
| title_short | Programming language concepts |
| title_sort | programming language concepts |
| topic | Programmierung (DE-588)4076370-5 gnd Programmiersprache (DE-588)4047409-4 gnd Algorithmus (DE-588)4001183-5 gnd Formale Sprache (DE-588)4017848-1 gnd Programmierparadigma (DE-588)4308224-5 gnd Informatik (DE-588)4026894-9 gnd |
| topic_facet | Programmierung Programmiersprache Algorithmus Formale Sprache Programmierparadigma Informatik Konferenzschrift 2006 Wien |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=025147162&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT sestoftpeter programminglanguageconcepts |