Buch, Englisch, 512 Seiten, Format (B × H): 183 mm x 260 mm, Gewicht: 1152 g
ISBN: 978-0-521-59414-1
Verlag: Cambridge University Press
This textbook is a broad but rigorous survey of the theoretical basis for the design, definition, and implementation of programming languages, and of systems for specifying and proving program behaviour. Both imperative and functional programming are covered, as well as the ways of integrating these aspects into more general languages. Basic concepts and their properties are described with mathematical rigour, but the mathematical development is balanced by numerous examples of applications, particularly of program specification and proof, concurrent programming, functional programming (including the use of continuations and lazy evaluation), and type systems (including subtyping, polymorphism, and modularization). Assuming only knowledge of elementary programming, this text is perfect for advanced undergraduate and beginning graduate courses in programming language theory, and will also appeal to researchers and professionals in designing or implementing computer languages.
Autoren/Hrsg.
Fachgebiete
Weitere Infos & Material
1. Predicate logic; 2. The simple imperative language; 3. Program specifications and their proofs; 4. Arrays; 5. Failure, input-output and continuations; 6. Transition semantics; 7. Nondeterminism and guarded commands; 8. Shared-variable currency; 9. Communicating sequential processes; 10. The Lambda calculus; 11. An eager functional language; 12. Continuations in a functional language; 13. Iswim-like languages; 14. A normal-order language; 15. The simple type system; 16. Subtypes and intersection types; 17. Polymorphism; 18. Module specification; 19. Algol-like languages; Appendix: mathematical background.
