Algebra of programming
著者
書誌事項
Algebra of programming
（Prentice-Hall International series in computer science）
Prentice Hall, 1997
大学図書館所蔵 件 / 全27件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references and index
内容説明・目次
内容説明
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.
目次
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.
「Nielsen BookData」 より
