Functors in Functional Programming
The cluster focuses on explanations, definitions, and examples of functors, including their type signatures, instances like functions, and relations to composition, point-free style, and Haskell implementations.
Activity Over Time
Top Contributors
Keywords
Sample Comments
Can someone explain to me like I'm 5 what the big deal about functors is?
What makes a type constructor a functor, what's the difference
you're just not familiar with it. like when you ask what "a " means, well this code is literally defining what it means. it means whatever comes after the equals signin fact the example you picked is trivially simple even if you dont really know the syntax. all you need to do is not rage out and stop thinking. it's literally saying that "as f" is equal to "f as". so you dont even need to know what is, its e
You've definitely used Functors or Semigroups as well, you just didn't realize it.
The first definition is says it takes a normal function and returns a function in category f. But second definition says it takes a value fa and a function and return fb. Does the order of defining arguments matters or its just a taste of matter? Thanks.
Why does Mappable mean "something that you can apply functions to" and not "something that you can apply as if it were a function"?
"Compose" being Kleisli composition?
Wouldn't it be "fun (a |> b) = b a"? (call b on result of argument a)?
He of functional programming with bananas etc.?
It’s a type constructor that extends to functions. It’s a functor.