This book is currently unavailable on Open Library, check out available alternatives.
An edition of Elements of programming (2009)

Elements of programming

by

  • 8 Want to read
  • 1 Have read
Cover of: Elements of programming by Alexander A. Stepanov, Alexander A. Stepanov
Preview Only
Preview

My Reading Lists:

Create a new list
  • 8 Want to read
  • 1 Have read

Check nearby libraries

Buy this book

This book is currently unavailable on Open Library, check out available alternatives.
Last edited by MARC Bot
March 7, 2023 | History
Edit
An edition of Elements of programming (2009)

Elements of programming

by

  • 8 Want to read
  • 1 Have read

A mathematically oriented approach to practical programming with an emphasis on abstraction via mathematical generalizations.

Publish Date
Publisher
Addison-Wesley
Language
English
Pages
276

Check nearby libraries

Buy this book

Previews available in: English

Subjects

Computer algorithms Computer programming
Edition Availability
Cover of: Elements of programming
Elements of programming
2009, Addison-Wesley
Hardcover in English
Cover of: Elements of programming
Elements of programming
2009, Addison-Wesley
in English

Add another edition?

Book Details

Table of Contents

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

Edition Notes

Includes bibliographical references and index.

Published in
Upper Saddle River, NJ

Classifications

Dewey Decimal Class
005.1
Library of Congress
QA76.6 .S726 2009, QA76.6.S726 2009

Contributors

Author
Paul R. McJones

The Physical Object

Format
Hardcover
Pagination
xiv, 262p.
Number of pages
276
Dimensions
24cm x 16.5 x 1.8 centimeters
Weight
20 ounces

Edition Identifiers

Open Library
OL23170351M
ISBN 10
032163537X
LCCN
2009007604
OCLC/WorldCat
297146408
LibraryThing
8322551
Goodreads
6142482

Work Identifiers

Work ID
OL7957166W

Source records

Community Reviews (0)

No community reviews have been submitted for this work.

Lists

Download catalog record: RDF / JSON / OPDS | Wikipedia citation