5 ms·
> We've "abstracted (the function map) over the type constructor (of the data structure being mapped over)". Then why didn't they just call those types "Mappab
by jimbokun 7y ago
> We've "abstracted (the function map) over the type constructor (of the data structure being mapped over)".
Then why didn't they just call those types "Mappables"?
- jolux 7y agoBecause the concept is category-theoretic in nature and they wanted to foreground that.
- centimeter 7y agoThat would probably have been clearer to newbies, but they already had a complete terminology ready to go from category theory and it's not hard to remember "Functor ~ Mappable". Plus, "obvious" names break down once you start building up hierarchies of these properties. One of the reasons people have a hard time communicating the (simple) ideas behind other algebraic objects like Applicatives, Monads, etc. is because it's hard to come up with short, self-descriptive names for them. The search for such names has resulted in several famously bad analogies, such as "a Monad is like a Burrito".
- bojo 7y agoI think this is a great question because it tends to come up a lot. What do you call the following common operations? - 1 + 0 - 1 * 1 - "string" ++ "" - [1, 2, 3] ++ [] As far as I know there is no term for this grouping of operations outside of functional programming languages which use category theory. We call it a "monoid" based on the following precise definition: > In abstract algebra, a branch of mathematics, a monoid is an algebraic structure with a single associative binary operation and an identity element[1]. I used the "identity element" specifically in my examples above since they tend to be a good way to grasp what is going on. It turns out a "functor" has more properties than just being "mappable", which is why we like using the more precise term in our literature. However, it's still a decent intuition if you aren't familiar with the concept. For example, in the parent comment the 'f' in the second line of code shows that it is some kind of structure that adheres to a Functor, and also infers that this structure can also be mapped over. This is a nice property because without caring about the implementation, we can still do functor-specific operations over abstract structures. [1] https://en.wikipedia.org/wiki/Monoid https://en.wikipedia.org/wiki/Monoid
- pacala 7y agoconcat?
- JoshuaDavid 7y agoI can't think of any way for 1 * 1 to be concatenation. I think the point GP was making is that a monoid has something to do with a function f that takes two arguments a and b where there is a single value for b such that f(a, special_value) == a. I think. As someone who doesn't really understand FP concepts I would probably call those functions "functions that can sensibly be used in a call to array.reduce"
- pacala 7y agoIt doesn't need to have a perfect metaphor for all possible cases, just something you can picture in an instant: 'behaves like a concating variable length box sequences'. It's a mnemonic / learning aid, not a formal spec. But I can stretch it :) +: concat marbles sequence * : concat prime factors sequence ++: concat box sequence For * , it can also be reduced to + via logarithms. I just don't have a good metaphor for '+ over reals' this morning.
- diegoperini 7y ago> I just don't have a good metaphor for '+ over reals' this morning. Skimming through my thesaurus, I found a word for it: "Totalize".
- chas 7y ago“append”* is the name chosen for the binary operator in the Haskell standard library’s monoid abstraction and “concat” seems like the same genre, so I would expect people would be fine with the intuition for “concat” as well. Given that this is a thread on functional jargon, it might be interesting to note list metaphors as being useful for thinking about monoid might derive from lists being free monoids (in many contexts). This means that all functions from a collection elements to a monoid can be thought of as functions from that collection into a list with the appropriate type of elements and then a fold (also called a reduction) over that list. This knowledge can be super useful for thinking about program structure e.g. conceptually mapreduce is a general tool for large-scale distributed computation over monoids. *it’s actually called “mappend”[0], short for monoid append, but I think the point still stands (and there is, in fact, a function called “mconcat”[1] but folds of a list of monoidal values using “mappend” to combine them.) [0] http://hackage.haskell.org/package/base-4.14.0.0/docs/Data-Monoid.html#v:mappend http://hackage.haskell.org/package/base-4.14.0.0/docs/Data-M... [1] http://hackage.haskell.org/package/base-4.14.0.0/docs/Data-Monoid.html#v:mconcat http://hackage.haskell.org/package/base-4.14.0.0/docs/Data-M...
- bweitzman 7y agoTo be fair, the term "map" comes from math [0], and so at the time these functions were created, there weren't other good naming choices. Mappable and Functor are just about as opaque as each other if you don't know what mapping is. Though now that FP concepts are mainstream, I think there is a good case to offer some friendlier, more familiar names: Functor -> Mappable Applicative -> Pairable Monad -> Thenable [0]: https://softwareengineering.stackexchange.com/questions/203374/origin-of-common-list-processing-function-names https://softwareengineering.stackexchange.com/questions/2033...
- jolux 7y agoAll I see here is weakening the descriptive power of those terms by replacing them with more common ones. It may look easier but I think it’s probably better not to carry in baggage from other languages that doesn’t quite fit.
- whateveracct 7y agoGiving descriptive names just harms intuition building in the long run. I've been writing Haskell for over 5 years and to this day when I see <$>, <*>, >>= in my code I don't substitute English words for them.
- kortex 7y agoWas about to complain you can't google them, but I tried it and it worked. Huh. I guess you can google symbols now, even traditionally escapey-ones. News to me. mentalModel.update(). The query `python @` fails pretty hard though.
- rossng 7y agoFor Haskell stuff, you can go one better and use Hoogle: https://hoogle.haskell.org/?hoogle=%28%3C%24%3E%29&scope=set%3Astackage https://hoogle.haskell.org/?hoogle=%28%3C%24%3E%29&scope=set...
- whateveracct 7y agoI tend to just query the repl when I don't know a symbol. :info (>=>)
- agentultra 7y agoBecause names don’t carry meaning, they’re pointers: https://www.parsonsmatt.org/2019/08/30/why_functor_doesnt_matter.html https://www.parsonsmatt.org/2019/08/30/why_functor_doesnt_ma... “Functor,” points to a specific concept in Haskell and a slightly different one in Category Theory but otherwise it is fairly unambiguous given enough context. The concept not only refers to the type and the associated “map” operation but also the axioms of identity and composition and their properties. “Mappable,” is a very common name people pick in these discussions but it doesn’t clarify the meaning any more than calling it “Rose.” It may in fact cause more harm than good if a name like Mappable exists in more contexts. There are plenty of objects one can apply a map operation to that are not valid Functors.
- zozbot234 7y agoWell, Functor is a bit of a misnomer; it really should be called TypeEndofunctor. The short form was really adopted as a mischievous pun on the use of "functor" in the OOP community.
- dllthomas 7y agoI don't think TypeEndofunctor conveys any additional information when discussing a Haskell typeclass. > The short form was really adopted as a mischievous pun on the use of "functor" in the OOP community. Citation needed.
- dllthomas 7y agoI should note that naming things with mischievous puns certainly wasn't beyond early Haskellers - that's the origin of `return` as a name for part of the Monad interface (since quasi-deprecated in favor of `pure`). I just have never heard that allegation about `functor`, which seems to have been taken directly from mathematics that predate any notion of function object. It's possible that OO programmers and the mathematicians both borrowed it from the same source (it seems to have originated in linguistics).
- justinmeiners 7y ago