From Mathematics to Generic Programming
Häftad · Engelska · 293 sidor · 2015
- Format
- Häftad
- Språk
- Engelska
- Omfång
- 293 sidor
- Förlag
- Addison-Wesley
- Utgiven
- 2015
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
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
Priser & butiker
Priser & butiker
3 butiker · Häftad · lägsta pris först
Skriver du om boken på en blogg eller sajt? .
- Frakt
- Frakt från 29 kr · fri frakt över 249 kr
- Leverans
- 2-3 vardagar. Levereras hem, till ombud eller till paketskåp. Skickas med Budbee eller Instabox.
- Betalning
- Kort · Swish · Klarna · Faktura 30 dagar · Delbetalning
- Öppet köp
- 30 dagars öppet köp
- Medlemskap
- Bokus Play · 5 % medlemsrabatt · fri frakt för medlemmar
- Omdöme
- 3.4 av 5 på Trustpilot (1 634 omdömen)
- Frakt
- Frakt från 39 kr · fri frakt över 249 kr
- Leverans
- 2-4 vardagar. Levereras hem eller till ombud. Skickas med PostNord.
- Betalning
- Kort · Swish · Klarna · Faktura 30 dagar · Delbetalning
- Öppet köp
- 30 dagars öppet köp
- Omdöme
- 4.2 av 5 på Trustpilot (452 omdömen)
- Frakt
- Frakt från 35 kr · fri frakt över 249 kr
- Leverans
- 2-3 vardagar. Levereras hem eller till ombud. Skickas med Schenker eller Early Bird.
- Betalning
- Kort · Swish · Faktura 30 dagar · Delbetalning · Direktbank
- Öppet köp
- 30 dagars öppet köp
- Omdöme
- 3.8 av 5 på Trustpilot (10 195 omdömen)
- Frakt
- Frakt från 29 kr · fri frakt över 249 kr
- Leverans
- 2-3 vardagar. Levereras hem, till ombud eller till paketskåp. Skickas med Budbee eller Instabox.
- Betalning
- Kort · Swish · Klarna · Faktura 30 dagar · Delbetalning
- Öppet köp
- 30 dagars öppet köp
- Medlemskap
- Bokus Play · 5 % medlemsrabatt · fri frakt för medlemmar
- Omdöme
- 3.4 av 5 på Trustpilot (1 634 omdömen)
- Frakt
- Frakt från 39 kr · fri frakt över 249 kr
- Leverans
- 2-4 vardagar. Levereras hem eller till ombud. Skickas med PostNord.
- Betalning
- Kort · Swish · Klarna · Faktura 30 dagar · Delbetalning
- Öppet köp
- 30 dagars öppet köp
- Omdöme
- 4.2 av 5 på Trustpilot (452 omdömen)
- Frakt
- Frakt från 35 kr · fri frakt över 249 kr
- Leverans
- 2-3 vardagar. Levereras hem eller till ombud. Skickas med Schenker eller Early Bird.
- Betalning
- Kort · Swish · Faktura 30 dagar · Delbetalning · Direktbank
- Öppet köp
- 30 dagars öppet köp
- Omdöme
- 3.8 av 5 på Trustpilot (10 195 omdömen)
Samma ISBN jämförs hos alla butiker — priserna gäller samma utgåva.
Annonslänkar: Booki kan få provision när du handlar via våra länkar. Det påverkar inte ditt pris. Externa länkar utan pris ingår inte i jämförelsen.
Annonslänkar: Booki kan få provision när du handlar via våra länkar. Det påverkar inte ditt pris. Externa länkar utan pris ingår inte i jämförelsen.
Håll koll på priset
Håll koll på priset
Väntar du på ett lägre pris?
Bevaka priset på denna utgåva av From Mathematics to Generic Programming och få besked när det sjunker.
Spara den här boken
Logga in för att lägga till i din bokhylla, bevaka priset och recensera.
Om boken
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
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
Bokfakta
Författare
Alexander A. Stepanov, Daniel E. Rose
Förlag
Addison-Wesley
Utgivningsår
2015
Format
Häftad
Sidantal
293
Språk
Engelska
Fysiska detaljer
illustraties
Dewey
005.1/1
ISBN
9780321942043
Kategorier
Medverkande
Författare
Alexander A. Stepanov, Daniel E. Rose
