|
|
|
|
| LEADER |
02525nmm a2200277 u 4500 |
| 001 |
EB000363247 |
| 003 |
EBX01000000000000000216299 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
130626 ||| eng |
| 020 |
|
|
|a 9781447141563
|
| 100 |
1 |
|
|a Sestoft, Peter
|
| 245 |
0 |
0 |
|a Programming Language Concepts
|h Elektronische Ressource
|c by Peter Sestoft
|
| 250 |
|
|
|a 1st ed. 2012
|
| 260 |
|
|
|a London
|b Springer London
|c 2012, 2012
|
| 300 |
|
|
|a XIV, 278 p. 17 illus
|b online resource
|
| 505 |
0 |
|
|a Preface -- Introduction -- Interpreters and Compilers -- From Concrete Syntax to Abstract Syntax -- A First-Order Functional Language -- High-Order Functions -- Polymorphic Types -- Imperative Languages -- Compiling Micro-C -- Real-World Abstract Machines -- Garbage Collection -- Continuations -- Locally Optimizing Compiler -- Crash Course in F# -- Index
|
| 653 |
|
|
|a Compilers (Computer programs)
|
| 653 |
|
|
|a Compilers and Interpreters
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
| 490 |
0 |
|
|a Undergraduate Topics in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/978-1-4471-4156-3
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-1-4471-4156-3?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 005.45
|
| 520 |
|
|
|a Programming Language Concepts uses a functional programming language (F#) as the metalanguage in which to present all concepts and examples, and thus has an operational flavour, enabling practical experiments and exercises. It includes basic concepts such as abstract syntax, interpretation, stack machines, compilation, type checking, and garbage collection techniques, as well as the more advanced topics on polymorphic types, type inference using unification, co- and contravariant types, continuations, and backwards code generation with on-the-fly peephole optimization. Programming Language Concepts covers practical construction of lexers and parsers, but not regular expressions, automata and grammars, which are well covered elsewhere. It throws light on the design and technology of Java and C# to strengthen students’ understanding of these widely used languages. The examples present several interpreters and compilers for toy languages, including a compiler for a small but usable subset of C, several abstract machines, a garbage collector, and ML-style polymorphic type inference. Each chapter has exercises based on such examples. Complete example source files, lecture slides and other materials are available at http://www.itu.dk/people/sestoft/plc/
|