Theories of Programming Languages (Paperback)

John C. Reynolds

ISBN 10: 0521106974 / ISBN 13: 9780521106979

Published by Cambridge University Press, Cambridge, 2008

About this Item

Paperback. 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Seller Inventory # 9780521106979

Bibliographic Details

• Title: Theories of Programming Languages (Paperback)
• Publisher: Cambridge University Press, Cambridge
• Publication Date: 2008
• Language: English
• ISBN 10: 0521106974
• ISBN 13: 9780521106979
• Binding: Paperback
• Condition: new

About this title

Synopsis

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.

Book Description

This is a broad but rigorous survey of the theory underlying computer programming languages. It shows how a wide variety of language concepts can be designed cleanly, defined precisely, used effectively, and implemented correctly. The mathematical development is balanced by numerous examples of applications such as program specification and proof, concurrent programming, functional programming, and type systems.Assuming only knowledge of elementary programming and elementary mathematics, this text is perfect for advanced undergraduate and beginning graduate courses in programming language theory, and will also appeal to researchers and professionals.