Algebra Programming
Richard Bird, Oege De Moor
Sep 1996, Paperback, 312 pagesISBN13: 9780135072455
ISBN10: 013507245X
This title may be printed on demand which may result in extended delivery times
Description
- Table of Contents
- Reviews
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.
- Description
Table of Contents
- Reviews
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.
- Description
- Table of Contents
Reviews


