Descripciones mejoradas de Syndetics:

"Ask a mechanical, structural, or electrical engineer how far they would get without a heavy reliance on a firm mathematical foundation, and they will tell you, 'not far.' Yet so-called software engineers often practice their art with little or no idea of the mathematical underpinnings of what they are doing. And then we wonder why software is notorious for being delivered late and full of bugs, while other engineers routinely deliver finished bridges, automobiles, electrical appliances, etc., on time and with only minor defects. This book sets out to redress this imbalance. Members of my advanced development team at Adobe who took the course based on the same material all benefited greatly from the time invested. It may appear as a highly technical text intended only for computer scientists, but it should be required reading for all practicing software engineers."
--Martin Newell, Adobe Fellow

"The book contains some of the most beautiful code I have ever seen."
--Bjarne Stroustrup, Designer of C++

"I am happy to see the content of Alex's course, the development and teaching of which I strongly supported as the CTO of Silicon Graphics, now available to all programmers in this elegant little book."
--Forest Baskett, General Partner, New Enterprise Associates

"Paul's patience and architectural experience helped to organize Alex's mathematical approach into a tightly-structured edifice--an impressive feat!"
--Robert W. Taylor, Founder of Xerox PARC CSL and DEC Systems Research Center

Elements of Programming provides a different understanding of programming than is presented elsewhere. Its major premise is that practical programming, like other areas of science and engineering,must be based on a solid mathematical foundation. The book shows that algorithms implemented in a real programming language, such as C++, can operate in the most general mathematical setting. For example, the fast exponentiation algorithm is defined to work with any associative operation. Using abstract algorithms leads to efficient, reliable, secure, and economical software.

This is not an easy book. Nor is it a compilation of tips and tricks for incremental improvements in your programming skills. The book's value is more fundamental and, ultimately, more critical for insight into programming. To benefit fully, you will need to work through it from beginning to end, reading the code, proving the lemmas, and doing the exercises. When finished, you will see how the application of the deductive method to your programs assures that your system's software components will work together and behave as they must.

The book presents a number of algorithms and requirements for types on which they are defined. The code for these descriptions--also available on the Web--is written in a small subset of C++ meant to be accessible to any experienced programmer. This subset is defined in a special language appendix coauthored by Sean Parent and Bjarne Stroustrup.

Whether you are a software developer, or any other professional for whom programming is an important activity, or a committed student, you will come to understand what the book's experienced authors have been teaching and demonstrating for years--that mathematics is good for programming, and that theory is good for practice.

Tabla de contenidos provista por Syndetics

• Preface(p. ix)
• About the Authors(p. xiii)
• 1 Foundations(p. 1)
• 1.1 Categories of Ideas: Entity, Species, Genus(p. 1)
• 1.2 Values(p. 2)
• 1.3 Objects(p. 4)
• 1.4 Procedures(p. 6)
• 1.5 Regular Types(p. 6)
• 1.6 Regular Procedures(p. 8)
• 1.7 Concepts(p. 10)
• 1.8 Conclusions(p. 14)
• 2 Transformations and Their Orbits(p. 15)
• 2.1 Transformations(p. 15)
• 2.2 Orbits(p. 18)
• 2.3 Collision Point(p. 21)
• 2.4 Measuring Orbit Sizes(p. 27)
• 2.5 Actions(p. 28)
• 2.6 Conclusions(p. 29)
• 3 Associative Operations(p. 31)
• 3.1 Associativity(p. 31)
• 3.2 Computing Powers(p. 33)
• 3.3 Program Transformations(p. 35)
• 3.4 Special-Case Procedures(p. 39)
• 3.5 Parameterizing Algorithms(p. 42)
• 3.6 Linear Recurrences(p. 43)
• 3.7 Accumulation Procedures(p. 46)
• 3.8 Conclusions(p. 47)
• 4 Linear Orderings(p. 49)
• 4.1 Classification of Relations(p. 49)
• 4.2 Total and Weak Orderings(p. 51)
• 4.3 Order Selection(p. 52)
• 4.4 Natural Total Ordering(p. 61)
• 4.5 Clusters of Derived Procedures(p. 62)
• 4.6 Extending Order-Selection Procedures(p. 63)
• 4.7 Conclusions(p. 63)
• 5 Ordered Algebraic Structures(p. 65)
• 5.1 Basic Algebraic Structures(p. 65)
• 5.2 Ordered Algebraic Structures(p. 70)
• 5.3 Remainder(p. 71)
• 5.4 Greatest Common Divisor(p. 76)
• 5.5 Generalizing gcd(p. 79)
• 5.6 Stein gcd(p. 81)
• 5.7 Quotient(p. 81)
• 5.8 Quotient and Remainder for Negative Quantities(p. 83)
• 5.9 Concepts and Their Models(p. 85)
• 5.10 Computer Integer Types(p. 87)
• 5.11 Conclusions(p. 88)
• 6 Iterators(p. 89)
• 6.1 Readability(p. 89)
• 6.2 Iterators(p. 90)
• 6.3 Ranges(p. 92)
• 6.4 Readable Ranges(p. 95)
• 6.5 Increasing Ranges(p. 103)
• 6.6 Forward Iterators(p. 106)
• 6.7 Indexed Iterators(p. 110)
• 6.8 Bidirectional Iterators(p. 111)
• 6.9 Random-Access Iterators(p. 113)
• 6.10 Conclusions(p. 114)
• 7 Coordinate Structures(p. 115)
• 7.1 Bifurcate Coordinates(p. 115)
• 7.2 Bidirectional Bifurcate Coordinates(p. 119)
• 7.3 Coordinate Structures(p. 124)
• 7.4 Isomorphism, Equivalence, and Ordering(p. 124)
• 7.5 Conclusions(p. 131)
• 8 Coordinates with Mutable Successors(p. 133)
• 8.1 Linked Iterators(p. 133)
• 8.2 Link Rearrangements(p. 134)
• 8.3 Applications of Link Rearrangements(p. 140)
• 8.4 Linked Bifurcate Coordinates(p. 143)
• 8.5 Conclusions(p. 148)
• 9 Copying(p. 149)
• 9.1 Writability(p. 149)
• 9.2 Position-Based Copying(p. 151)
• 9.3 Predicate-Based Copying(p. 157)
• 9.4 Swapping Ranges(p. 164)
• 9.5 Conclusions(p. 168)
• 10 Rearrangements(p. 169)
• 10.1 Permutations(p. 169)
• 10.2 Rearrangements(p. 172)
• 10.3 Reverse Algorithms(p. 174)
• 10.4 Rotate Algorithms(p. 178)
• 10.5 Algorithm Selection(p. 186)
• 10.6 Conclusions(p. 189)
• 11 Partition and Merging(p. 191)
• 11.1 Partition(p. 191)
• 11.2 Balanced Reduction(p. 198)
• 11.3 Merging(p. 202)
• 11.4 Conclusions(p. 208)
• 12 Composite Objects(p. 209)
• 12.1 Simple Composite Objects(p. 209)
• 12.2 Dynamic Sequences(p. 216)
• 12.3 Underlying Type(p. 222)
• 12.4 Conclusions(p. 225)
• Afterword(p. 227)
• Appendix A Mathematical Notation(p. 231)
• Appendix B Programming Language(p. 233)
• B.1 Language Definition(p. 233)
• B.2 Macros and Trait Structures(p. 240)
• Bibliography(p. 243)
• Index(p. 247)

Notas de autor provistas por Syndetics

Alexander Stepanov studied mathematics at Moscow State University from 1967 to 1972. He has been programming since 1972: first in the Soviet Union and, after emigrating in 1977, in the United States. He has programmed operating systems, programming tools, compilers, and libraries. His work on foundations of programming has been supported by GE, Brooklyn Polytechnic, AT&T,HP, SGI, and, since 2002, Adobe. In 1995 he received the Dr. Dobb's Journal Excellence in Programming Award for the design of the C++ Standard Template Library.

Paul McJones studied engineering mathematics at the University of California, Berkeley, from 1967 to 1971. He has been programming since 1967 in the areas of operating systems, programming environments, transaction processing systems, and enterprise and consumer applications. He has been employed by the University of California, IBM, Xerox, Tandem, DEC, and, since 2003, Adobe. In 1982 he and his coauthors received the ACM Programming Systems and Languages Paper Award for their paper "The Recovery Manager of the System R Database Manager."