Basic Category Theory For Computer Scientists


Download Basic Category Theory For Computer Scientists PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Basic Category Theory For Computer Scientists book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.

Download

Basic Category Theory for Computer Scientists


Basic Category Theory for Computer Scientists

Author: Benjamin C. Pierce

language: en

Publisher: MIT Press

Release Date: 1991-08-07


DOWNLOAD





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


Basic Category Theory for Computer Scientists

Author: Benjamin C. Pierce

language: en

Publisher: MIT Press

Release Date: 1991-08-07


DOWNLOAD





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


Basic Category Theory

Author: Tom Leinster

language: en

Publisher: Cambridge University Press

Release Date: 2014-07-24


DOWNLOAD





A short introduction ideal for students learning category theory for the first time.