Basic category theory for computer scientists / Benjamin C. Pierce.
By: Pierce, Benjamin C [author.]
.
Contributor(s): IEEE Xplore (Online Service) [distributor.] | MIT Press [publisher.].
Material type: 
BookSeries: Foundations of computing: Publisher: Cambridge, Massachusetts : MIT Press, c1991Distributor: [Piscataqay, New Jersey] : IEEE Xplore, [1991]Description: 1 PDF (xiii, 100 pages).Content type: text Media type: electronic Carrier type: online resourceISBN: 0262660717; 9780262288460.Subject(s): Computer science -- Mathematics | Categories (Mathematics)Genre/Form: Electronic books.Additional physical formats: Print version: No titleDDC classification: 511.3 Online resources: Abstract with links to resource Also available in print.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.
Includes bibliographical references (p. 81-91) and index.
Restricted to subscribers or individual electronic text purchasers.
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.
Also available in print.
Mode of access: World Wide Web
Description based on PDF viewed 12/23/2015.
There are no comments for this item.