It groups functional operations into kinds that you can make assertions about after a selection of the operations have been performed.
Haskell does -
add :: Integer -> Integer -> Integer
so the compiler can check all the branches of code to ensure that statement is invariant.
f:B->A and g:A->C
(P1) id . f = f and (P2) g . id = g, in particular it is unique, since if id':A->A had the same property, then
id' = id . id' = id,
where the first equality follows by (P1) and the second by (P2').
Definition: A group is a category with a single object, all of whose morphisms are both epic[1] and monic[2].
In particular, if you drop the epic and monic requirements, a category that has only one object can be viewed as a monoid[3] under morphism composition.
[1]: http://en.wikipedia.org/wiki/Epimorphism
For example, in a category of "types", each object could be a type (e.g.: int, float, list(int), etc.), and each arrow could be a function between those types.
With that example, just think of all the arrows between, say, string -> int! There's "length()", "md5()", "to_i()", etc. And don't even get me started on the "identity" arrows of string back to itself (upcase, downcase, strip, etc). We're talking gazillions of arrows.