Basic category theory for computer scientists
著者
書誌事項
Basic category theory for computer scientists
（MIT Press series in the foundations of computing）
MIT Press, c1991
大学図書館所蔵 件 / 全68件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p. [81]-91) and index
内容説明・目次
内容説明
Basic Category Theory for Computer Scientists provides a straightforward presentation of the basic constructions and terminology of category theory, including limits, functors, natural transformations, adjoints, and cartesian closed categories.
Category theory is a branch of pure mathematics that is becoming an increasingly important tool in theoretical computer science, especially in programming language semantics, domain theory, and concurrency, where it is already a standard language of discourse. Assuming a minimum of mathematical preparation, Basic Category Theory for Computer Scientists provides a straightforward presentation of the basic constructions and terminology of category theory, including limits, functors, natural transformations, adjoints, and cartesian closed categories. Four case studies illustrate applications of category theory to programming language design, semantics, and the solution of recursive domain equations. A brief literature survey offers suggestions for further study in more advanced texts.
Contents
Tutorial * Applications * Further Reading
目次
- Tutorial
- applications
- further reading
「Nielsen BookData」 より
