Picture 1 of 1
Stock photo
Picture 1 of 1
Stock photo
Foundations of Computing Ser.: Basic Category Theory for Computer Scientists by Benjamin C. Pierce (1991, Trade Paperback)
Great Book Prices Store (349132)
97.3% positive feedback
Price:
$47.96
Free shipping
Returns:
14 days returns. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Condition:
Basic Category Theory for Computer Scientists, Paperback by Pierce, Benjamin C., ISBN 0262660717, ISBN-13 9780262660716, Brand New, Free shipping in the US Assuming a minimum of mathematical preparation, presents 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. Annotation copyright Book News, Inc. Portland, Or.
- Buy It NowBasic Category Theory for Computer Scientists, Paperback by Pierce, Benjamin ...
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
About this product
Product Identifiers
PublisherMIT Press
ISBN-100262660717
ISBN-139780262660716
eBay Product ID (ePID)103317
Product Key Features
Number of Pages116 Pages
LanguageEnglish
Publication NameBasic Category Theory for Computer Scientists
Publication Year1991
SubjectGroup Theory, Computer Science
TypeTextbook
Subject AreaMathematics, Computers
AuthorBenjamin C. Pierce
SeriesFoundations of Computing Ser.
FormatTrade Paperback
Dimensions
Item Height0.3 in
Item Weight7.6 Oz
Item Length9.1 in
Item Width7.1 in
Additional Product Features
Intended AudienceTrade
LCCN91-008489
Dewey Edition20
Grade FromCollege Graduate Student
IllustratedYes
Dewey Decimal511.3
SynopsisBasic 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., 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, 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
LC Classification NumberQA76.9.M35P54 1991
