Algebra of programming

Author(s)

• Bird, R. S. (Richard Simpson)
• Moor, Oege de

Bibliographic Information

Algebra of programming

Richard Bird and Oege de Moor

（Prentice-Hall International series in computer science）

Prentice Hall, 1997

Note

Includes bibliographical references and index

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"

Details

• NCID: BA30132015
• ISBN:
  • 013507245X
• LCCN: 96027688
• Country Code: us
• Title Language Code: eng
• Text Language Code: eng
• Place of Publication: London ; New York
• Pages/Volumes: xiv, 295 p.
• Classification:
  • LCC : QA76.6
  • DC20 : 005.13/1
• Subject Headings:
  • LCSH : Electronic digital computers -- Programming
  • LCSH : Computer algorithms
  • LCSH : Programming (Mathematics)
• Parent Bibliography ID:
  • BA00010507