Category Theory for Computing ScienceTextbook for advanced undergraduates, graduates and researchers in computing science and mathematics expounds the basic ideas and construction of category theory, with examples from and applications to computing science. The emphasis is on examples and on understanding the concepts rather than on formal proofs of the theorems. Annotation copyright. |
Other editions - View all
Common terms and phrases
arrow f bijection binary C₁ called cartesian closed category category of sets cocone codomain coequalizer colimit commutative diagram composite cone countable data type defined definition denote described empty epimorphism equalizer equation equivalence relation eval example Exercise fact fibration finite products fixed point follows FP sketch free monoid function f functor F fuzzy set ƒ and g give given graph homomorphism Hom(A Hom(B Hom(C identity arrow implies induced initial model injective integers inverse left adjoint Let f linear sketch monic monoid homomorphism monomorphism natural isomorphism natural numbers object natural transformation node notation operation opfibration p₁ pair of arrows poset preserves proj₁ proj₂ proof Proposition pullback pushout recursive satisfies Section semigroup Show source and target structure subcategory subobject subset succ Suppose surjective takes terminal object Theorem topos unique arrow universal element variable w-CPO wreath product