A Duality for Algebras of Lattice-Valued Modal Logic
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
From quantale algebroids to topological spaces: Fixed- and variable-basis approaches
Fuzzy Sets and Systems
Formal Specification of Substitutability Property for Fault-Tolerance in Reactive Autonomic Systems
Proceedings of the 2010 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the 9th SoMeT_10
A co-relational model of data for large shared data banks
Communications of the ACM
A co-Relational Model of Data for Large Shared Data Banks
Queue - Programming Languages
Some New Approaches in Functional Programming Using Algebras and Coalgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Information and Computation
Dualities for Algebras of Fitting's Many-Valued Modal Logics
Fundamenta Informaticae - Logic, Language, Information and Computation
Kan extensions for program optimisation or: art and dan explain an old trick
MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
Generic programming with adjunctions
SSGIP'10 Proceedings of the 2010 international spring school conference on Generic and Indexed Programming
Systematicity, accessibility, and universal properties
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
Hi-index | 0.03 |
Category theory is a branch of abstract algebra with incredibly diverse applications. This text and reference book is aimed not only at mathematicians, but also researchers and students of computer science, logic, linguistics, cognitive science, philosophy, and any of the other fields in which the ideas are being applied. Containing clear definitions of the essential concepts, illuminated with numerous accessible examples, and providing full proofs of all important propositions and theorems, this book aims to make the basic ideas, theorems, and methods of category theory understandable to this broad readership. Although assuming few mathematical pre-requisites, the standard of mathematical rigour is not compromised. The material covered includes the standard core of categories; functors; natural transformations; equivalence; limits and colimits; functor categories; representables; Yoneda's lemma; adjoints; monads. An extra topic of cartesian closed categories and the lambda-calculus is also provided - a must for computer scientists, logicians and linguists!This Second Edition contains numerous revisions to the original text, including expanding the exposition, revising and elaborating the proofs, providing additional diagrams, correcting typographical errors and, finally, adding an entirely new section on monoidal categories. Nearly a hundred new exercises have also been added, many with solutions, to make the book more useful as a course text and for self-study.