Algebra of programming
Author(s)
Bibliographic Information
Algebra of programming
Prentice Hall, an imprint of Pearson Education, 2003, c1997
Available at / 1 libraries
-
No Libraries matched.
- Remove all filters.
Note
"A Pearson Education print on demand edition"--Cover
"Transferred to digital print on demand 2003"--T.p. verso
Bibliography: p. [271]-289
Includes index
"Prentice-Hall International series in computer science"--Added t.p. verso
Description and Table of Contents
Description
This is the 100th. book in the Prentice Hall International Series in Computer Science.
It's main purpose is to show how to calculate programs. Describing an algebraic approach to programming based on a categorical calculus of relations, Algebra of Programming is suitable for the derivation of individual programs, and for the study of programming principles in general. The programming principles discussed are those paradigms and strategies of program construction that form the core of Algorithm Design. Examples of such principles include: dynamic programming, greedy algorithms, exhaustive search, and divide-and-conquer.The fundamentsl ideas of the algebraic approach are illustrated by an extensive study of optimisation problems.
Table of Contents
1. Programs.
2. Functions and Categories.
3. Applications.
4. Relationships and Allegories.
5. Datatypes in Allegories.
6. Optimisation Problems.
7. Thinning Algorithms.
8. Dynamic Programming.
9. Greedy Algorithms.
Appendices.
by "Nielsen BookData"