Currying in Python with decorators
In some functional languages like haskell, all functions are automatically curried. Consider the following function: f a b c = a + b + c The type inference engine determines that the type is: f :: Num a => a -> a -> a -> a This should be exactly what we expected. It says…