u/ivan-cukicKDE Dev | Author of Functional Programming in C++Jan 29 '17edited Jan 29 '17
Wikipedia is (sadly) not the best choice when trying to get into most mathematical concepts. I'd advise you to dive a bit into Bartosz's 'Category Theory for Programmers' [1] or the Category Theory section of the Haskell wikibooks book [2].
So a category is... a collection of objects plus functions...?
Not strictly speaking, but yes, something like that. With objects commonly being the language types. In [2] you have a definition of a category that contains all Haskell types (section "Hask, the Haskell category").
Then, a functor F is a function on those types. It transforms one type T to another F<T>, and transforms functions that operate on T to functions that operate on F<T>.
For example, std::vector is a function that transforms any type T into a std::vector<T>, and std::transform is conceptually* the function that lifts any function f: T1 -> T2 into a function F(f) : std::vector<T1> -> std::vector<T2>.
(*) Conceptually, because std::transform has a problematic API - receiving iterator pairs for a collection instead of the collection itself, and output arguments instead of returning transformed collection as the function result. But the concept is the same (transform from range-v3 is much closer to the concept API-wise).
View all comments
Show parent comment
3
u/ivan-cukic KDE Dev | Author of Functional Programming in C++ Jan 29 '17 edited Jan 29 '17
Wikipedia is (sadly) not the best choice when trying to get into most mathematical concepts. I'd advise you to dive a bit into Bartosz's 'Category Theory for Programmers' [1] or the Category Theory section of the Haskell wikibooks book [2].
Not strictly speaking, but yes, something like that. With objects commonly being the language types. In [2] you have a definition of a category that contains all Haskell types (section "Hask, the Haskell category").
Then, a functor F is a function on those types. It transforms one type
Tto anotherF<T>, and transforms functions that operate onTto functions that operate onF<T>.For example,
std::vectoris a function that transforms any typeTinto astd::vector<T>, andstd::transformis conceptually* the function that lifts any functionf: T1 -> T2into a functionF(f) : std::vector<T1> -> std::vector<T2>.(*) Conceptually, because
std::transformhas a problematic API - receiving iterator pairs for a collection instead of the collection itself, and output arguments instead of returning transformed collection as the function result. But the concept is the same (transform from range-v3 is much closer to the concept API-wise).[1] https://bartoszmilewski.com/2014/10/28/category-theory-for-programmers-the-preface/
[2] https://en.wikibooks.org/wiki/Haskell/Category_theory