About this product

Product Identifiers

PublisherAddison Wesley Professional

ISBN-100321942043

ISBN-139780321942043

eBay Product ID (ePID)201601669

Product Key Features

Number of Pages320 Pages

Publication NameFrom Mathematics to Generic Programming

LanguageEnglish

SubjectProgramming / General, Programming / Algorithms, Life Sciences / Genetics & Genomics, General

Publication Year2014

TypeTextbook

AuthorDaniel Rose, Alexander Stepanov

Subject AreaMathematics, Computers, Science

FormatTrade Paperback

Dimensions

Item Height0.6 in

Item Weight15.2 Oz

Item Length8.9 in

Item Width6.1 in

Additional Product Features

Intended AudienceScholarly & Professional

LCCN2014-034539

IllustratedYes

SynopsisThis book is a great introduction to the core principles of generic programming for the experienced programmer. The authors work through examples showing how to analyze the requirements of an algorithm and make it as general as possible. The book includes several programming "laws" of particular interest to those building software components. The authors show how programmers can become more effective by learning about the idea of abstraction and the math it relies on. In an engaging and accessible fashion, they describe how these mathematical results were first discovered and are surprisingly useful in programming., 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

LC Classification NumberQA76.6245.S74 2015