Skip to content
Register Sign in Wishlist

Theories of Programming Languages

£49.99

  • Date Published: April 2009
  • availability: Available
  • format: Paperback
  • isbn: 9780521106979

£ 49.99
Paperback

Add to cart Add to wishlist

Other available formats:
Hardback, eBook


Looking for an inspection copy?

This title is not currently available on inspection

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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 programme behaviour. Both imperative and functional programming are covered, as well as the ways of integrating these aspects into more general languages. Recognising a unity of technique beneath the diversity of research in programming languages, the author presents an integrated treatment of the basic principles of the subject. He identifies the relatively small number of concepts, such as compositional semantics, binding structure, domains, transition systems and inference rules, that serve as the foundation of the field. Assuming only knowledge of elementary programming and mathematics, this text is perfect for advanced undergraduate and beginning graduate courses in programming language theory and also will appeal to researchers and professionals in designing or implementing computer languages.

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: April 2009
    • format: Paperback
    • isbn: 9780521106979
    • length: 516 pages
    • dimensions: 244 x 170 x 26 mm
    • weight: 0.81kg
    • availability: Available
  • 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.

  • Author

    John C. Reynolds, Carnegie Mellon University, Pennsylvania

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×