You don't need to go deep. Types and functions (ignoring non-termination) form a category. Functional programming (Haskell programmers in particular) uses many results from it.
e.g.
building any "container" type (collections, options, futures,etc..) is the mapping of objects of an (endo) functor, the mapping of functions is given by fmap/map
As an example, just from the functor laws you get map (f.g) = map f . map g
Natural transformations between functors gives you parametricity and "theorems for free"
Another result that's used directly is the CoYonneda lemma (but I'm still trying to understand it :) )
The point is: category theory in spite of being totally abstract offers many interesting results that can be applied to day-to-day coding :)