By D. E. Rydeheard

Read Online or Download Computational Category Theory (Prentice-Hall International Series in Computer Science) PDF

Similar logic books

Sets, logic & numbers

This article is designed to offer the coed a history within the foundations of algebra and research. The algebra of symbolic good judgment and the idea that of set are brought early within the textual content in order that the most definitional improvement of the advanced quantity method flows simply from a collection of postulates for the common numbers.

Fuzzy Logic Foundations and Industrial Applications

Fuzzy good judgment Foundations and commercial functions is an geared up edited selection of contributed chapters masking simple fuzzy common sense idea, fuzzy linear programming, and purposes. specified emphasis has been given to insurance of contemporary examine effects, and to commercial purposes of fuzzy good judgment.

Extra resources for Computational Category Theory (Prentice-Hall International Series in Computer Science)

Sample text

The function which finds the maximum integer in a list of integers. 2. The function which sums a list of integers. 3. The function which takes a list of coefficients a 0 , a1 , . . , an and a value x and evaluates the polynomial a 0 +a1 ×x+. . an ×xn . 10 EXERCISES 4. Use the append function, concatenating lists end to end, to define the function which reverses a list. 5. The function maplist which applies a function to all items in a list returning the list of results. What is its most general type?

Rarely do we consider categories without some additional internal structure. For example, categories may be equipped with products or coproducts of pairs of objects. We shall define these constructs in the next chapter and show that they can be represented as functions. Thus a category with additional structure consists of the four functions mentioned 48 CATEGORIES AND FUNCTORS above together with extra functions recording the additional structure. g. that all pairs of objects have a product) into functions whose existence is the property in question.

We may go further and consider objects again to be sets but arrows to be relations between sets (labelled with their source and target sets). A relation r : a → b is a subset of the cartesian product a × b. The composition sr of r : a → b with s : b → c is defined by sr = {(x, z) : ∃y ∈ b . (x, y) ∈ r ∧ (y, z) ∈ s} Let us call this category SetRel . 2 Graphs We consider directed multi-graphs, that is, pairs of sets N (of nodes) and E (of edges) together with pairs of functions s, t : E → N (source and target respectively).