LEADER 03720nam  22005295  450 
001 9910254844303321
005 20200705231237.0
010   $a3-319-60789-8
024 7 $a10.1007/978-3-319-60789-4
035   $a(CKB)4100000000587294
035   $a(DE-He213)978-3-319-60789-4
035   $a(MiAaPQ)EBC5578962
035   $a(PPN)204534534
035   $a(EXLCZ)994100000000587294
100   $a20170902d2017      u|         0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aProgramming Language Concepts /$fby Peter Sestoft
205   $a2nd ed. 2017.
210  1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2017.
215   $a1 online resource (XV, 341 p. 87 illus.) 
225 1 $aUndergraduate Topics in Computer Science,$x1863-7310
311   $a3-319-60788-X 
320   $aIncludes bibliographical references and index.
327   $aIntroduction -- Interpreters and Compilers -- From Concrete Syntax to Abstract Syntax -- A First-Order Functional Language -- Higher-Order Functions -- Polymorphic Types -- Imperative Languages -- Compiling Micro-C -- Real-World Abstract Machines -- Garbage Collection -- Continuations -- A Locally Optimizing Compiler -- Compiling Micro-SML -- Real Machine Code -- A Crash Course in F#.
330   $aThis book uses a functional programming language (F#) as a metalanguage 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, garbage collection, and real machine code. Also included are 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.  This second edition includes two new chapters. One describes compilation and type checking of a full functional language, tying together the previous chapters. The other describes how to compile a C subset to real (x86) hardware, as a smooth extension of the previously presented compilers.The examples present several interpreters and compilers for toy languages, including compilers for a small but usable subset of C, abstract machines, a garbage collector, and ML-style polymorphic type inference.  Each chapter has exercises.   Programming Language Concepts covers practical construction of lexers and parsers, but not regular expressions, automata and grammars, which are well covered already.  It discusses the design and technology of Java and C# to strengthen students? understanding of these widely used languages.
410  0$aUndergraduate Topics in Computer Science,$x1863-7310
606   $aProgramming languages (Electronic computers)
606   $aData structures (Computer science)
606   $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037
606   $aData Storage Representation$3https://scigraph.springernature.com/ontologies/product-market-codes/I15025
615  0$aProgramming languages (Electronic computers)
615  0$aData structures (Computer science)
615 14$aProgramming Languages, Compilers, Interpreters.
615 24$aData Storage Representation.
676   $a005.73
700   $aSestoft$b Peter$4aut$4http://id.loc.gov/vocabulary/relators/aut$0740270
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910254844303321
996   $aProgramming Language Concepts$92513512
997   $aUNINA