- 本カテゴリの商品を2500円以上購入で買取金額500円UPキャンペーン対象商品です。商品出荷時に買取サービスでご利用いただけるクーポンをメールにてご案内させていただきます。 詳細はこちら (細則もこちらからご覧いただけます)
From Mathematics to Generic Programming (英語) ペーパーバック – 2014/11/17
Kindle 端末は必要ありません。無料 Kindle アプリのいずれかをダウンロードすると、スマートフォン、タブレットPCで Kindle 本をお読みいただけます。
In this substantive yet accessible book, pioneering software designer Alexander Stepanov and his colleague Daniel Rose illuminate the principles of generic programming and the mathematical concept of abstraction on which it is based, helping you write code that is both simpler and more powerful.
If you’re a reasonably proficient programmer who can think logically, you have all the background you’ll need. Stepanov and Rose introduce the relevant abstract algebra and number theory with exceptional clarity. They carefully explain the problems mathematicians first needed to solve, and then show how these mathematical solutions translate to generic programming and the creation of more effective and elegant code. To demonstrate the crucial role these mathematical principles play in many modern applications, the authors show how to use these results and generalized algorithms to implement a real-world public-key cryptosystem.
As you read this book, you’ll master the thought processes necessary for effective programming and learn how to generalize narrowly conceived algorithms to widen their usefulness without losing efficiency. You’ll also gain deep insight into the value of mathematics to programming—insight that will prove invaluable no matter what programming languages and paradigms you use.
You will learn about
- How to generalize a four thousand-year-old algorithm, demonstrating indispensable lessons about clarity and efficiency
- Ancient paradoxes, beautiful theorems, and the productive tension between continuous and discrete
- A simple algorithm for finding greatest common divisor (GCD) and modern abstractions that build on it
- Powerful mathematical approaches to abstraction
- How abstract algebra provides the idea at the heart of generic programming
- Axioms, proofs, theories, and models: using mathematical techniques to organize knowledge about your algorithms and data structures
- Surprising subtleties of simple programming tasks and what you can learn from them
- How practical implementations can exploit theoretical knowledge
Alexander A. Stepanov studied mathematics at Moscow State University from 1967 to 1972. He has been programming since 1972: first in the Soviet Union and, after emigrating in 1977, in the United States. He has programmed operating systems, programming tools, compilers, and libraries. His work on foundations of programming has been supported by GE, Polytechnic University, Bell Labs, HP, SGI, Adobe, and, since 2009, A9.com, Amazon’s search technology subsidiary. In 1995 he received the Dr. Dobb’s Journal Excellence in Programming Award for the design of the C++ Standard Template Library.
Daniel E. Rose is a research scientist who has held management positions at Apple, AltaVista, Xigo, Yahoo, and A9.com. His research focuses on all aspects of search technology, ranging from low-level algorithms for index compression to human–computer interaction issues in web search. Rose led the team at Apple that created desktop search for the Macintosh. He holds a Ph.D. in cognitive science and computer science from University of California, San Diego, and a B.A. in philosophy from Harvard University.
It starts by describing two algorithms which have been known for millennia - the Egyptian multiplication algorithm, and Euclid's greatest common measure algorithm - and then traces their evolution through history, describing how the algorithms were extended by successive generations of mathematicians. At each step, the authors implement the algorithm in C++, illustrating the process of taking a concrete algorithm and successively generalizing it. These two parallel threads of algorithm evolution and implementation generalization run throughout the book, providing a very compelling demonstration that the process of generalizing an algorithm is precisely the same as the process that mathematics has followed through the ages.
Along the way, we meet many great figures from mathematics, which turns what could have been a dry theoretical text into an absorbing story of the evolution of mathematical thought and the remarkable people that led it. This is an informal book, designed to be easy to read (in stark contrast to "Elements of Programming" by Stepanov and McJones), and any competent programmer with an understanding of high school math should be able to follow it comfortably.