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
By:
Benjamin C. Pierce (Professor University of Pennsylvania) Series edited by:
Michael R. Garey, Albert Meyer Imprint: Massachusetts Inst of Tec Country of Publication: United States Dimensions:
Height: 229mm,
Width: 178mm,
Spine: 8mm
Weight: 227g ISBN:9780262660716 ISBN 10: 0262660717 Series:Foundations of Computing Pages: 116 Publication Date:07 August 1991 Recommended Age: From 18 years Audience:
Professional and scholarly
,
Professional and scholarly
,
Undergraduate
,
Undergraduate
Format:Paperback Publisher's Status: Active
Benjamin C. Pierce is Professor of Computer and Information Science at the University of Pennsylvania.
