<p style="margin:0px">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.</p><p style="margin:0px"></p><p style="margin:0px">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.</p><p style="margin:0px"></p><p style="margin:0px">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.</p><p style="margin:0px"></p><p style="margin:0px">You will learn about</p><ul><li><div style="margin:0px">How to generalize a four thousand-year-old algorithm, demonstrating indispensable lessons about clarity and efficiency</div></li><li><div style="margin:0px">Ancient paradoxes, beautiful theorems, and the productive tension between continuous and discrete</div></li><li><div style="margin:0px">A simple algorithm for finding greatest common divisor (GCD) and modern abstractions that build on it</div></li><li><div style="margin:0px">Powerful mathematical approaches to abstraction</div></li><li><div style="margin:0px">How abstract algebra provides the idea at the heart of generic programming</div></li><li><div style="margin:0px">Axioms, proofs, theories, and models: using mathematical techniques to organize knowledge about your algorithms and data structures</div></li><li><div style="margin:0px">Surprising subtleties of simple programming tasks and what you can learn from them</div></li><li><div style="margin:0px">How practical implementations can exploit theoretical knowledge</div></li></ul><p style="margin:0px"></p><p style="margin:0px"><b>Alexander A. Stepanov</b> has been programming since 1972–first in the Soviet Union and, since emigrating in 1977, in the United States. He has programmed operating systems, programming tools, compilers, and libraries. His work on the foundations of programming has been supported by GE, Polytechnic University, Bell Labs, HP, SGI, Adobe, and, since 2009, A9.com, Amazon’s search subsidiary. In 1995, he received the<i>Dr. Dobb’s Journal </i>Excellence in Programming Award for the design of the C&#43;&#43; Standard Template Library.</p><p style="margin:0px"></p><p style="margin:0px"><b>Daniel E. Rose</b> 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, ranging from low-level algorithms for index compression to human—computer interaction. Rose led the Apple team that created desktop search for the Mac. He holds a Ph.D. in cognitive science and computer science from the University of California, San Diego, and a B.A. in philosophy from Harvard.</p>