| Basic Category Theory for Computer Scientists Contributor(s): Pierce, Benjamin C. (Author) |
|
 |
ISBN: 0262660717 ISBN-13: 9780262660716 Publisher: MIT Press OUR PRICE: $34.65 Product Type: Paperback - Other Formats Published: August 1991 Annotation: 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. Benjamin C. Pierce received his doctoral degree from Carnegie Mellon University. Contents: Tutorial. Applications. Further Reading. |
| Additional Information |
| BISAC Categories: - Mathematics | Logic - Computers | Computer Science |
| Dewey: 511.3 |
| LCCN: 91-8489 |
| Series: Foundations of Computing |
| Physical Information: 0.38" H x 7.1" W x 8.98" (0.49 lbs) 116 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: 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 |
Contributor Bio(s): Pierce, Benjamin C.: - Benjamin C. Pierce is Professor of Computer and Information Science at the University of Pennsylvania. |
