Unifying theories of programming
Author(s)
Bibliographic Information
Unifying theories of programming
（Prentice Hall series in computer science）
Prentice Hall, 1998
Available at / 4 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references and index
Description and Table of Contents
Description
This book provides a synthesis of the theory of programming. It aims to use mathematical theory of programming to provide a similar basis for specification, design and implementation of programs. It is wide ranging both in its subject matter and also in its approach and style. The first five chapters justify and introduce the main concepts and methods to be used within the text, relating the goal of unification to the achievements of other branches of science and mathematics. The remaining chapters introduce more advanced programming language features one by one. The main methods of programming are summarised and concluded in a manner suitable for those already familiar with programming semantics. Definitions are accompanied by examples and the theorems by meticulous proof.
Table of Contents
1. Preface. 2. Glossary of Notations. 3. The Challenge of Unification. 4. The Logic of Engineering Design. 5. Relations. 6. Designs. 7. Linking Theories. 8. The Algebra of Programs. 9. Implementation. 10. Concurrency. 11. Communication. 12. High Order Programming. 13. Operational Semantics. Appendix. References. Index.
by "Nielsen BookData"