A supplement for Category theory for computing science by Michael Barr, Charles Wells

By Michael Barr, Charles Wells

The elemental recommendations of type conception are defined during this textual content which permits the reader to enhance their knowing steadily. With over three hundred routines, scholars are inspired to observe their development. a large insurance of subject matters in type thought and computing device technology is constructed together with introductory remedies of cartesian closed different types, sketches and basic express version idea, and triples. The presentation is casual with proofs integrated merely after they are instructive, offering a extensive insurance of the competing texts on type conception in desktop technology.

Show description

Read or Download A supplement for Category theory for computing science PDF

Best algebra books

Homology of classical groups over finite fields, associated infinite loop spaces

Considered one of Che hallmarks of major advances in arithmetic is the invention of unforeseen relationships among diversified parts. probably the main extraordinary contemporary instance of such an improve is D« Quillen! s improvement of upper algebraic K-theory within which algebra and topology are similar in a new and basic approach.

Extra info for A supplement for Category theory for computing science

Example text

Seeing what a construction says about monoids has not usually been so instructive. However, certain concepts used to study the algebraic structure of monoids generalize to categories in a natural way, and often the theorems about them remain true. In addition, applications of monoids to the theory of automata have natural generalizations to categories, and some work has been done on these generalized ideas. In this chapter we describe some aspects of categories as generalized monoids. 1 with the concept of ¯bration, which has been used in recent research on polymorphism.

For example, we - K BinTree(Nat) G ? Stack ? Stack(BinTree(Nat)) - with Ke = t or even L - Stack(Nat) H ? BinTree - ? BinTree(Stack(Nat)) with Le = s. Models of these types will be interpreted as stacks of binary trees of natural numbers, respectively binary trees of stacks of natural numbers. Clearly what is at issue here is a notion of a type having an input node and an output node. However, things are not quite so simple, as the following example shows. 5 The basic idea of this type is that of n-place records (Pascal) or structures (C).

7. The rest of the material is not used elsewhere in the book. 1 Fibrations In this section, we describe ¯brations, which are special types of functors important in category theory and which have been proposed as useful in certain aspects of computer science. The next section gives a way of constructing ¯brations from set or categoryvalued functors. 1 Fibrations and op¯brations Let P : ¡ ! be a functor between small categories, let f : C ¡ ! D be an arrow of , and let P (Y ) = D. An arrow u:X ¡ !

Download PDF sample

Rated 4.13 of 5 – based on 37 votes