Algebra of Programming

Front Cover
Prentice Hall, 1997 - Computers - 295 pages
1 Review

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.

From inside the book

What people are saying - Write a review

Review: Algebra of Programming

User Review  - Hugo Sereno Ferreira - Goodreads

This is a mind-blowing book. Mind you: if you come from a OO background, finishing the first chapter is enough for a brag-right. Notwithstanding, while reading this book, you'll have the constant feeling that programming will never be the same for you. Read full review

Review: Algebra of Programming

User Review  - Brian - Goodreads

This was just too hardcore for me the first time around... at some point in the middle I realize I'm reading a bunch of symbols and I have no idea what anything means so I had to stop. Will try again ... Read full review


Functions and Categories
Relations and Allegories

9 other sections not shown

Common terms and phrases

References to this book

All Book Search results »

About the author (1997)

Dr. Oege de Moor is a Lecturer in Computation at the University of Oxford, and a Tutorial Fellow of Magdalen College.

Bibliographic information