Theories of Programming Languages

This text is perfect for advanced undergraduate and beginning graduate courses in programming language theory.

List of contents

Preface; 1. Predicate Logic; 2. The Simple Imperative Language; 3. Programme Specifications and their Proofs; 4. Arrays; 5. Failure, Input-Output and Continuations; 6. Transition Semantics; 7. Nondeterminism and Guarded Commands; 8. Shared-variable Concurrency; 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; Appendices; Bibliography; Index.

Summary

First published in 1998, this textbook is a broad but rigourous survey of the theoretical basis for the design, definition and implementation of programming languages and of systems for specifying and proving program behaviour.

Product details

• Authors: John C Reynolds, John C. Reynolds, John C. (Carnegie Mellon University Reynolds, Reynolds John C.
• Publisher: Cambridge Academic
• Languages: English
• Product format: Hardback
• Released: 13.10.1998
• EAN: 9780521594141
• ISBN: 978-0-521-59414-1
• Dimensions: 178 mm x 254 mm x 29 mm
• Weight: 1100 g
• Subjects: Natural sciences, medicine, IT, technology > IT, data processing > Programming languages; Mathematical theory of computation, Programming & scripting languages: general, Programming and scripting languages: general, COMPUTERS / Languages / General