Due to international delivery delays we cannot guarantee delivery of international orders prior to Xmas.   

Programming Language Concepts - pr_262158

Programming Language Concepts

Paperback

$112.10

Or 4 payments of $28.02 with

delivery message Free delivery for orders over $49.99

Add to Wish List
Delivered in 10 - 14 days
Available for Click and Collect
This 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.

Product code: 9783319607887

ISBN 9783319607887
Dimensions (HxWxD in mm) H235xW155
Series Undergraduate Topics in Computer Science
No. Of Pages 341
Publisher Springer International Publishing AG
Edition 2nd ed. 2017
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.