Theoretical Computer Science for the Working Category Theorist
Theoretical Computer Science for the Working Category Theorist

Author: Noson S. Yanofsky

Publisher: Cambridge University Press

Published: 2022-03-03

Total Pages: 150

ISBN-13: 9781108792745

DOWNLOAD EBOOK

Using basic category theory, this Element describes all the central concepts and proves the main theorems of theoretical computer science. Category theory, which works with functions, processes, and structures, is uniquely qualified to present the fundamental results of theoretical computer science. In this Element, readers will meet some of the deepest ideas and theorems of modern computers and mathematics, such as Turing machines, unsolvable problems, the P=NP question, Kurt Gödel's incompleteness theorem, intractable problems, cryptographic protocols, Alan Turing's Halting problem, and much more. The concepts come alive with many examples and exercises.

An Invitation to Applied Category Theory
An Invitation to Applied Category Theory

Author: Brendan Fong

Publisher: Cambridge University Press

Published: 2019-07-18

Total Pages: 351

ISBN-13: 1108582249

DOWNLOAD EBOOK

Category theory is unmatched in its ability to organize and layer abstractions and to find commonalities between structures of all sorts. No longer the exclusive preserve of pure mathematicians, it is now proving itself to be a powerful tool in science, informatics, and industry. By facilitating communication between communities and building rigorous bridges between disparate worlds, applied category theory has the potential to be a major organizing force. This book offers a self-contained tour of applied category theory. Each chapter follows a single thread motivated by a real-world application and discussed with category-theoretic tools. We see data migration as an adjoint functor, electrical circuits in terms of monoidal categories and operads, and collaborative design via enriched profunctors. All the relevant category theory, from simple to sophisticated, is introduced in an accessible way with many examples and exercises, making this an ideal guide even for those without experience of university-level mathematics.

Category Theory for Programmers (New Edition, Hardcover)
Category Theory for Programmers (New Edition, Hardcover)

Author: Bartosz Milewski

Publisher:

Published: 2019-08-24

Total Pages:

ISBN-13: 9780464243878

DOWNLOAD EBOOK

Category Theory is one of the most abstract branches of mathematics. It is usually taught to graduate students after they have mastered several other branches of mathematics, like algebra, topology, and group theory. It might, therefore, come as a shock that the basic concepts of category theory can be explained in relatively simple terms to anybody with some experience in programming.That's because, just like programming, category theory is about structure. Mathematicians discover structure in mathematical theories, programmers discover structure in computer programs. Well-structured programs are easier to understand and maintain and are less likely to contain bugs. Category theory provides the language to talk about structure and learning it will make you a better programmer.

Categories and Computer Science
Categories and Computer Science

Author: R. F. C. Walters

Publisher: Cambridge University Press

Published: 1991

Total Pages: 180

ISBN-13: 9780521422260

DOWNLOAD EBOOK

Category theory has become increasingly important and popular in computer science, and many universities now have introductions to category theory as part of their courses for undergraduate computer scientists. The author is a respected category theorist and has based this textbook on a course given over the last few years at the University of Sydney. The theory is developed in a straightforward way, and is enriched with many examples from computer science. Thus this book meets the needs of undergradute computer scientists, and yet retains a level of mathematical correctness that will broaden its appeal to include students of mathematics new to category theory.

Computability
Computability

Author: Nigel Cutland

Publisher: Cambridge University Press

Published: 1980-06-19

Total Pages: 268

ISBN-13: 9780521294652

DOWNLOAD EBOOK

What can computers do in principle? What are their inherent theoretical limitations? The theoretical framework which enables such questions to be answered has been developed over the last fifty years from the idea of a computable function - a function whose values can be calculated in an automatic way.

Category Theory for Computing Science
Category Theory for Computing Science

Author: Michael Barr

Publisher:

Published: 1995

Total Pages: 352

ISBN-13:

DOWNLOAD EBOOK

A wide coverage of topics in category theory and computer science is developed in this text, including introductory treatments of cartesian closed categories, sketches and elementary categorical model theory, and triples. Over 300 exercises are included.

Basic Category Theory
Basic Category Theory

Author: Tom Leinster

Publisher: Cambridge University Press

Published: 2014-07-24

Total Pages: 193

ISBN-13: 1107044243

DOWNLOAD EBOOK

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

Theoretical Computer Science for the Working Category Theorist
Theoretical Computer Science for the Working Category Theorist

Author: Noson S. Yanofsky

Publisher: Cambridge University Press

Published: 2022-03-03

Total Pages: 148

ISBN-13: 1108890679

DOWNLOAD EBOOK

Using basic category theory, this Element describes all the central concepts and proves the main theorems of theoretical computer science. Category theory, which works with functions, processes, and structures, is uniquely qualified to present the fundamental results of theoretical computer science. In this Element, readers will meet some of the deepest ideas and theorems of modern computers and mathematics, such as Turing machines, unsolvable problems, the P=NP question, Kurt Gödel's incompleteness theorem, intractable problems, cryptographic protocols, Alan Turing's Halting problem, and much more. The concepts come alive with many examples and exercises.

Category Theory in Context
Category Theory in Context

Author: Emily Riehl

Publisher: Courier Dover Publications

Published: 2017-03-09

Total Pages: 273

ISBN-13: 0486820807

DOWNLOAD EBOOK

Introduction to concepts of category theory — categories, functors, natural transformations, the Yoneda lemma, limits and colimits, adjunctions, monads — revisits a broad range of mathematical examples from the categorical perspective. 2016 edition.

Basic Category Theory for Computer Scientists
Basic Category Theory for Computer Scientists

Author: Benjamin C. Pierce

Publisher: MIT Press

Published: 1991-08-07

Total Pages: 117

ISBN-13: 0262326450

DOWNLOAD EBOOK

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