000 03145nam a22004575i 4500
001 978-1-4471-4156-3
003 DE-He213
005 20140220083237.0
007 cr nn 008mamaa
008 120608s2012 xxk| s |||| 0|eng d
020 _a9781447141563
_9978-1-4471-4156-3
024 7 _a10.1007/978-1-4471-4156-3
_2doi
050 4 _aQA76.7-76.73
050 4 _aQA76.76.C65
072 7 _aUMX
_2bicssc
072 7 _aUMC
_2bicssc
072 7 _aCOM051010
_2bisacsh
072 7 _aCOM010000
_2bisacsh
082 0 4 _a005.13
_223
100 1 _aSestoft, Peter.
_eauthor.
245 1 0 _aProgramming Language Concepts
_h[electronic resource] /
_cby Peter Sestoft.
264 1 _aLondon :
_bSpringer London :
_bImprint: Springer,
_c2012.
300 _aXIV, 278 p. 17 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aUndergraduate Topics in Computer Science,
_x1863-7310 ;
_v50
505 0 _aPreface -- 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.
520 _aProgramming 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/
650 0 _aComputer science.
650 1 4 _aComputer Science.
650 2 4 _aProgramming Languages, Compilers, Interpreters.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9781447141556
830 0 _aUndergraduate Topics in Computer Science,
_x1863-7310 ;
_v50
856 4 0 _uhttp://dx.doi.org/10.1007/978-1-4471-4156-3
912 _aZDB-2-SCS
999 _c100772
_d100772