Richard Bird, Oxford University Computing Laboratory

Published September, 1996 by Prentice Hall PTR (ECS Professional)

Copyright 1997, 352 pp.
Paper
ISBN 0-13-507245-X
$48.00

Sign up for future
mailings on this subject.

See other books about:
    Algorithms

Describes an algebraic approach to programming that permits the calculation of programs.

Introduces the fundamentals of algebra for programming. Presents paradigms and strategies of program construction that form the core of Algorithm Design. Discusses functions and categories; applications; relations and allegories; datatypes; recursive programs, optimization issues, thinning algorithms, dynamic programming and greedy algorithms. all programmers.



A complete presentation of the algebraic approach to programming, for graduate courses.

• Presents the fundamental paradigms and strategies of program construction at the core of Algorithm Design.

• Includes an extensive study of optimization problems.

• Covers dynamic programming, greedy algorithms, exhaustive search, divide-and-conquer and other principles.