Theories of Programming Languages

Theories of Programming Languages

by John C. Reynolds
ISBN-10:
0521106974
ISBN-13:
9780521106979
Pub. Date:
04/02/2009
Publisher:
Cambridge University Press
ISBN-10:
0521106974
ISBN-13:
9780521106979
Pub. Date:
04/02/2009
Publisher:
Cambridge University Press
Theories of Programming Languages

Theories of Programming Languages

by John C. Reynolds

Paperback

$77.99
Current price is , Original price is $77.99. You
$77.99 
  • SHIP THIS ITEM
    In stock. Ships in 1-2 days.
  • PICK UP IN STORE

    Your local store may have stock of this item.

  • SHIP THIS ITEM

    Temporarily Out of Stock Online

    Please check back later for updated availability.


Overview

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 behavior. It encompasses imperative and functional programming, as well as the ways of integrating these aspects into more general languages. Basic concepts and their properties are described with mathematical rigor, 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.

Product Details

ISBN-13: 9780521106979
Publisher: Cambridge University Press
Publication date: 04/02/2009
Edition description: New Edition
Pages: 516
Product dimensions: 6.70(w) x 9.60(h) x 1.20(d)

Table 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.
From the B&N Reads Blog

Customer Reviews