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.
FREE Two-Day Shipping for Students. Learn more |
| |||||||||||||||
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
Editorial Reviews
Review
"I found the whole book a distinct pleasure to read and certainly recommend this text for consideration by instructors." Mathematical Reviews
"clearly structured...the presentation is clear, and the typesetting often helps the reader to understand the structure of the formulas. Each chapter contains valuable exercises and profound bibliographic notes that can serve as a starting point for further reading. I shall use this excellent textbook in my lectures." Computing Reviews
"...an important book...It is thorough and well organized, and the explanations are very clear. I found the technical content to be in almost every respect flawless. Although written to be a student text, I believe that most researchers (and many practitioners) in programming lanauges (and related fields) would find it worth reading." Journal of Functional Programming
"clearly structured...the presentation is clear, and the typesetting often helps the reader to understand the structure of the formulas. Each chapter contains valuable exercises and profound bibliographic notes that can serve as a starting point for further reading. I shall use this excellent textbook in my lectures." Computing Reviews
"...an important book...It is thorough and well organized, and the explanations are very clear. I found the technical content to be in almost every respect flawless. Although written to be a student text, I believe that most researchers (and many practitioners) in programming lanauges (and related fields) would find it worth reading." Journal of Functional Programming
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.
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
5 of 7 people found the following review helpful:
4.0 out of 5 stars
Short and sweet,
By
This review is from: Theories of Programming Languages (Hardcover)
The book addresses various features of programming languages from a mathematical viewpoint. It discusses semantics of things from simple imperative language to failure to concurrency issues using channel based and shared memory concepts. It is a good book to get an idea about most of this concepts if you do away with the math involved. If you can swallow the math you will be able to come up with semantics for various systems fairly quickly. I have read the Winskel's book on semantics. I feel this book is a touch away from all the math stuff compared to Winskel's book. It would be better to refer to Winskels book after this book.
Share your thoughts with other customers: Create your own review
|
|
Inside This Book
(learn more)
First Sentence:
Actually, abstractness is lost whenever one defines phrases to be any particular family of sets - of character strings or anything else. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
direct denotational semantics, extrinsic semantics, letrec definitions, giving inference rules, resumption semantics, stopping symbol, binder whose scope, explicitly typed language, pack expression, simple imperative language, continuation semantics, semantic equations, nonterminal configuration, partial correctness specification, eager evaluation, domain isomorphisms, unfair executions, named tuples, simple type system, transition semantics, enclosing phrase, list int, pure lambda calculus, coincidence theorem, first canonical form Key Phrases - Capitalized Phrases (CAPs): (learn more)
Bibliographic Notes, Hint Use, Product Elimination, Product Introduction, Implementing One Abstraction New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Actually, abstractness is lost whenever one defines phrases to be any particular family of sets - of character strings or anything else. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
direct denotational semantics, extrinsic semantics, letrec definitions, giving inference rules, resumption semantics, stopping symbol, binder whose scope, explicitly typed language, pack expression, simple imperative language, continuation semantics, semantic equations, nonterminal configuration, partial correctness specification, eager evaluation, domain isomorphisms, unfair executions, named tuples, simple type system, transition semantics, enclosing phrase, list int, pure lambda calculus, coincidence theorem, first canonical form Key Phrases - Capitalized Phrases (CAPs): (learn more)
Bibliographic Notes, Hint Use, Product Elimination, Product Introduction, Implementing One Abstraction New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 35
books:
See all 35 books this book cites
13
books
cite this book:
See all 13 books citing this book
- Computer Science by Richard Jones on 6 pages
- Principles of Programming Languages (Prentice Hall International Series in Computing Science) by R. D. Tennent on 4 pages
- Communicating Sequential Processes (Prentice Hall International Series in Computing Science) by C.A.R. Hoare on page 181, Back Matter (1), and Back Matter (2)
- Mathematical Foundations of Programming Semantics: 9th International Conference New Orleans, La, Usa, April 7-10, 1993 : Proceedings (Lecture Notes in Computer Science) by International Conference on the Mathematical Foundations of programmin in Back Matter (1), Back Matter (2), and Back Matter (3)
- Semantics of Programming Languages (Prentice-Hall International Series in Computer Science) by R. D. Tennent in Back Matter (1), and Back Matter (2)
See all 35 books this book cites
- Specifying Software: A Hands-On Introduction by R. D. Tennent on page 59, and page 225
- Applied Semantics: International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000. Advanced Lectures (Lecture Notes in Computer Science) by Gilles Barthe in Back Matter
- Research Directions in Parallel Functional Programming by Kevin Hammond on page 458
- Programming Languages and Systems: First Asian Symposium, APLAS 2003, Beijing, China, November 27-29, 2003, Proceedings (Lecture Notes in Computer Science) by Atsushi Ohori on page 321
- Software Engineering 1: Abstraction and Modelling (Texts in Theoretical Computer Science. An EATCS Series) by Dines Bjørner on page
See all 13 books citing this book
Books on Related Topics
(learn more)
|
What Other Items Do Customers Buy After Viewing This Item?
Tags Customers Associate with This Product(What's this?)Click on a tag to find related items, discussions, and people.
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
Listmania!
|
|
So You'd Like to...
|
|
Look for Similar Items by Category
- Books > Computers & Technology > Programming > Languages & Tools
- Books > Computers & Technology > Programming > Software Design, Testing & Engineering > Software Development
- Books > New & Used Textbooks > Computer Science > Programming Languages
- Books > New & Used Textbooks > Computer Science > Software Design & Engineering
- Books > Science & Math > Mathematics
