> How do I get from X to Y by "literally the functor"?
NB You only need to get from X to Y in ways that arise from getting from A to B. Since there doesn't seem to be any relevant concept of morphism it's hard to see how ML functors are anything other than trivially category theoretical.
Re:Pitfalls in Haskell
by more_original on Wednesday August 24, 2016 @06:35PM
(#12355778)
Yes, I know! That's the point I'm trying to make. This whole discussion is about MustardTiger's claim that functors in OCaml have the same meaning as Functor in Haskell. While the latter model functors in the category-theoretic sense, the same cannot be said for the former.
I know you know :) I'm just reinforcing your point.
Re:Pitfalls in Haskell
by MustardTiger on Thursday August 25, 2016 @10:08AM
(#12359092)
Seriously, read the book instead of repeating nonsense: https://realworldocaml.org/v1/en/html/functors.html
That would be an answer for Haskell (though a proper one would refer to fmap), but it does not work like that in OCaml. You do know some OCaml, right?
But if it's so obvious, then you can say how it works for the following concrete example:
How do I get from X to Y by "literally the functor"?The point is: In the ML module system there is no equivalent to fmap: (A -> B) -> (F A -> F B), i.e. the functor action on morphisms. So, functors in Haskell and OCaml are different things. If you want to claim otherwise, you'll have to make an actual argument for it.