En savoir plus
This text develops a comprehensive theory of programming languages based on type systems and structural operational semantics. Language concepts are precisely defined by their static and dynamic semantics, presenting the essential tools both intuitively and rigorously while relying on only elementary mathematics. These tools are used to analyze and prove properties of languages and provide the framework for combining and comparing language features. The broad range of concepts includes fundamental data types such as sums and products, polymorphic and abstract types, dynamic typing, dynamic dispatch, subtyping and refinement types, symbols and dynamic classification, parallelism and cost semantics, and concurrency and distribution. The methods are directly applicable to language implementation, to the development of logics for reasoning about programs, and to the formal verification language properties such as type safety. This thoroughly revised second edition includes exercises at the end of nearly every chapter and a new chapter on type refinements.
Table des matières
1. Judgment and rules; 2. Statics and dynamics; 3. Total functions; 4. Finite data types; 5. Types and propositions; 6. Infinite data types; 7. Variable types; 8. Partiality and recursive types; 9. Dynamic types; 10. Subtyping; 11. Dynamic dispatch; 12. Control flow; 13. Symbolic data; 14. Mutable state; 15. Parallelism; 16. Concurrency and distribution; 17. Modularity; 18. Equational reasoning; 19. Appendices.
A propos de l'auteur
Robert Harper is a professor in the computer science department at Carnegie Mellon University, Pennsylvania. His main research interest is in the application of type theory to the design and implementation of programming languages and to the mechanization of their meta-theory. Harper is a recipient of the Allen Newell Medal for Research Excellence and the Herbert A. Simon Award for Teaching Excellence, and is an Association for Computing Machinery Fellow.
Résumé
This book defines and analyzes a full range of programming language concepts in a single unifying framework that isolates core abstractions and avoids irrelevant details of specific languages. It stresses the central role of types and teaches the use of rigorous mathematical techniques for proving properties of languages and programs.
Commentaire
Review of previous edition: 'Harper's book provides a comprehensive treatment of the foundations of computation. He touches on a surprising range of concepts that arise in language design: from simple types to polymorphism to dependent types to modules; from strict to lazy to parallel computation; and from proof techniques for reasoning about extensional behavior to practical, compositional cost models in the presence of garbage collection. More importantly, throughout the book he uses types and the principles of type theory to organize the material and help us discover the orthogonal, composable abstractions that arise naturally not only in the design of programming languages but also in logics and mathematics. This approach helps uncover the fundamental structure lurking inside programming languages of today, and provides a principled approach to the designs for tomorrow.' Greg Morrisett, Cornell University, New York
