DeepRead
Cover of From Mathematics to Generic Programming

From Mathematics to Generic Programming

Alexander A. Stepanov, Daniel E. Rose · 2015

Programming and computer science › C and C++

#1,839 most recommended

About the book

The book traces how basic algorithms, such as multiplication by repeated addition and Euclid's greatest common divisor, can be rewritten in more abstract form so they work over any type that meets their requirements. It covers the number theory and abstract algebra needed for this, along with the C++ implementations that follow. Alexander Stepanov wrote it with Daniel E. Rose. The central claim is that sound software abstraction comes from mathematics: a generic algorithm is best understood by identifying the minimal algebraic structure it really requires, such as a semigroup or a group. The authors argue that stating these requirements precisely is what makes code both reusable and correct across different types. They present this as a path from concrete examples to generic code, explaining the mathematics along the way rather than assuming it.

Written by Claude from what it knows of this book.

What Hacker News says 55% recommend · 5% critical

02.552014202020252016 peak · 5
This bookAverage book in C and C++

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 3 want to read
  • 0 reading
  • 0 have read

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

The threads it came up in

Details

First published
2015
ISBN
9780321942043
Editions known
2 at Open Library
Open Library
OL17145291W

Computer algorithmsEuclid's algorithmGeneric programming (Computer science)Genetics, data processingMathematicsabstractiongeneric programmingnumber theorysoftware development

Explore in the mosaic

Read next: its neighbours on the mosaic