Programming in Ada 2022

The established textbook on the Ada language for over 40 years, updated to cover the full details of Ada 2022.

John Barnes (Author)

9781009564779, Cambridge University Press

Paperback / softback, published 28 November 2024

960 pages
24.5 x 18.8 x 4.9 cm, 1.78 kg

'As he has done similarly before, in this new edition of his classic 'Programming in Ada' text, John Barnes guides the reader through the latest version of Ada, namely 'Ada 2022', with both rigour and vigor. John is unique in his ability to explain Ada features in a way that makes them both immediately understandable and immediately usable, because of the helpful context and witty examples he provides. As a member of the group that maintains the Ada language standard, John knows the ins and outs of why the features ended up as they did, but he seems to always be the best at rising above the minutiae the typical language design team member worries about, to see the big picture and how a feature fits into the overall language, and how it can benefit the programmers building critical applications in Ada.' S. Tucker Taft, Director of Language Research, Ada Core

The latest version of 'Programming in Ada' covers the full details of the core language Ada 2022 as approved by ISO in 2023, including new features that aid program proof and the efficient use of multicore architectures. The book is arranged in four parts. The first part introduces the key ideas to the newcomer with a working example illustrating the basic ideas. The algorithmic features, structural features such as OOP and multitasking, and details of the standard library and interaction with the external environment are all covered in subsequent parts. This comprehensive guide includes several working examples and is enhanced by a range of supplementary online materials, including a dozen complete executable programs, five of which illustrate important new features. 'Programming in Ada' is a must-have for anyone looking to learn Ada programming language, and will serve as a definitive reference for years to come.

Foreword Steve Baird and Jeff Cousins
Preface
Part I. An Overview: 1. Introduction
2. Simple concepts
3. Abstraction
4. Programs and libraries
Program 1. Magic moments
Part II. Algorithmic Aspects: 5. Lexical style
6. Scalar types
7. Control structures
8. Arrays and records
9. Expression structures
10. Subprograms
11. Access types
Program 2. Sylvan sorter
Part III. The Big Picture: 12. Packages and private types
13. Overall structure
Program 3. Rational reckoner
14. Object oriented programming
15. Exceptions
16. Contracts
17. Numeric types
18. Parameterized types
19. Generics
20. Tasking
21. Object oriented techniques
22. Tasking techniques
Program 4. Super sieve
Part IV. Completing the Story: 23. Predefined library
Program 5. Wild words
24. Container library
25. Interfacing
Program 6. Playing pools
26. The specialized annexes
27. Finale
Appendix 1. Reserved words, etc.
Appendix 2. Glossary
Answers to Exercises
Bibliography
Index.

Subject Areas: Mathematical theory of computation [UYA]