Basic category theory for computer scientists / Benjamin C. Pierce.
1991
QA76.9.M35 P54 1991eb
Formats
| Format | |
|---|---|
| BibTeX | |
| MARCXML | |
| TextMARC | |
| MARC | |
| DublinCore | |
| EndNote | |
| NLM | |
| RefWorks | |
| RIS |
Linked e-resources
Linked Resource
Details
Title
Basic category theory for computer scientists / Benjamin C. Pierce.
Author
ISBN
9780262288460 (electronic bk.)
026228846X (electronic bk.)
0262660717
9780262660716
026228846X (electronic bk.)
0262660717
9780262660716
Publication Details
Cambridge, Mass. : MIT Press, ©1991.
Language
English
Description
1 online resource (xiii, 100 pages).
Call Number
QA76.9.M35 P54 1991eb
Dewey Decimal Classification
511.3
Summary
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.
Access Note
Access limited to authorized users.
Source of Description
OCLC-licensed vendor bibliographic record.
Record Appears in