|
|
|
|
|
by sshine
2697 days ago
|
|
I can't imagine what makes FP too primitive. It is essentially abstract. FP's degree of being primitive depends on the coarseness of its combinators. What I find limiting is easy access to efficient, immutable data structures. Ocaml leaves you with the option to switch to mutable data structures at the cost of safety, and Haskell provides things like the ST monad for handling mutable updates safely at the cost of type-level complexity. |
|
And solving the same kind of problems without polymorphism (be that multiple dispatch, type classes or otherwise), is a struggle.