FUCKING DYNAMIC PROGRAMMING

How do I learn to do this shit?

I'm going to fail introduction to algorithms and be the disgrace of MIT...

>>9
\dick -> (.) (.) :: t -> (a1 -> b -> c) -> a1 -> (a -> b) -> a -> c

Since "dick" is unused, it's simpler just to write (.) (.) :: (a1 -> b -> c) -> a1 -> (a -> b) -> a -> c, and it's easier to comprehend if you rename the type variables.

let boobs = (.) (.) :: (b -> c -> d) -> b -> (a -> c) -> a -> d

Lets name the arguments to "boobs" f, b, g and a. It is then likely equivalent to the following definition

let boobs f b g a = f b (g a)