Re:Don’t Be Scared Of Functional Programming
by peaton on Wednesday July 02, 2014 @02:02PM
(#7978534)
I knew I was making a strong assertion when I mentioned function composition. I'm grateful for your feedback, but perhaps you could elaborate? I don't see why they have to be "very different". I think you called me on a certain case, but an example like this demonstrates that they are not so "very different":
Or even:
I don't see how these are not a form of function composition. I'm definitely no expert. But I'd really appreciate an elaboration so I can learn from any mistake I'm making.
[ Parent
| on HN ]
Re:Don’t Be Scared Of Functional Programming
by mneary on Wednesday July 02, 2014 @02:34PM
(#7978738)
Function composition is a single, special case of a function accepting functional arguments. You could define the compose operator as below:
compose : (a -> b) -> (b -> c) -> (a -> c)
a `compose` b = \x -> b(a(x))
However, there is a whole spectrum of additionally possible functions which can be built to accept functions as arguments. Here's a couple of example: partial3 : (Integer -> Integer -> Integer) -> (Integer -> Integer)
partial3 f = f 3
map : [a] -> (a -> b) -> [b]
map [] f = []
map (x:xs) f = (f x):(map xs f)
The first one takes a function and applies an argument, 3; the next one takes a list and a function and maps the list using the provided function. The idea of functions as arguments is a very powerful one, and from my understanding one with which people sometimes struggle.