Haskell partial application pondering.

gistfile1.hs

-- In this case it would be in theory be possible to create a single thunk for "ab" if pointless was partially applied as so:
-- pointless 1 2
-- The resulting Int -> Int method would then only have to evaluate ab once because otherwise it never changes.
-- The obvious possibility this could cause would be caching very large intermediate representations that would otherwise be 
-- garbage collected.
pointless :: Int -> Int -> Int -> Int
pointless a b c = 
  let ab = a + b
  in  ab + c