Become a Readings Member to make your shopping experience even easier. Sign in or sign up for free!

Become a Readings Member. Sign in or sign up for free!

Hello Readings Member! Go to the member centre to view your orders, change your details, or view your lists, or sign out.

Hello Readings Member! Go to the member centre or sign out.

From Mathematics to Generic Programming
Paperback

From Mathematics to Generic Programming

$98.99
Sign in or become a Readings Member to add this title to your wishlist.

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

Read More
In Shop
Out of stock
Shipping & Delivery

$9.00 standard shipping within Australia
FREE standard shipping within Australia for orders over $100.00
Express & International shipping calculated at checkout

MORE INFO
Format
Paperback
Publisher
Pearson Education (US)
Country
United States
Date
27 November 2014
Pages
320
ISBN
9780321942043

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

Read More
Format
Paperback
Publisher
Pearson Education (US)
Country
United States
Date
27 November 2014
Pages
320
ISBN
9780321942043