Programming Language Concepts [electronic resource] /by Peter Sestoft.
by Sestoft, Peter [author.]; SpringerLink (Online service).
Material type:
BookSeries: Undergraduate Topics in Computer Science: 50Publisher: London : Springer London : 2012.Description: XIV, 278 p. 17 illus. online resource.ISBN: 9781447141563.Subject(s): Computer science | Computer Science | Programming Languages, Compilers, InterpretersDDC classification: 005.13 Online resources: Click here to access online | Item type | Current location | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
| QA76.76.C65 (Browse shelf) | Available | ||||
| Long Loan | MAIN LIBRARY | QA76.7-76.73 (Browse shelf) | Available |
Close shelf browser
| QA76.76.C65 Objective-C Programmer’s Reference | QA76.76.C65 Guide to ILDJIT | QA76.76.C65 Foundational Java | QA76.76.C65 Programming Language Concepts | QA76.76.C65 From Linear Operators to Computational Biology | QA76.76.C65 Logic Programming with Prolog | QA76.76.C65 Modern Compiler Design |
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.
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/
There are no comments for this item.