flipA :: (a -> b -> c) -> b -> a -> c
flipA f x y = f y x

and this

flipB :: (a -> b -> c) -> b -> a -> c  
flipB f = \x y -> f y x

What is it specifically about currying that makes flipA possible? Also, with flipB, could someone explain the beta reduction? It looks like f is not being acted on, just passed along, Would it look more like this in lambda calculus?

(\x \y -> f y x)

then

(\x \y -> f y x) g a b 

gives

g b a  ?

LB