| Author: |
|
John C. Reynolds
|
| Title: |
 |
Theories of Programming Languages |
| Moochable copies: |
|
No copies available |
| Amazon suggests: |
|
| Topics: |
|
| Published in: |
|
English |
| Binding: |
|
Hardcover |
| Pages: |
|
514 |
| Date: |
|
1998-10-13 |
| ISBN: |
|
0521594146 |
| Publisher: |
|
Cambridge University Press |
| Weight: |
|
2.38 pounds |
| Size: |
|
7.2 x 1.3 x 10.08 inches |
Amazon prices: |
|
|
|
|
|
| Description: |
|
Product Description
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.
|
| URL: |
|
http://bookmooch.com/0521594146 |
|
|
