3 ms·
Haskell has tuples, so it could use an: (a, b) -> c representation. If the uniform/canonical way to use functions is defined to be curried, then flip can si
by Peaker 14y ago
Haskell has tuples, so it could use an:
(a, b) -> c
representation. If the uniform/canonical way to use functions is defined to be curried, then flip can simply return them curried.
- masklinn 14y ago> Haskell has tuples, so it could use an: Which it does: curry :: ((a, b) -> c) -> a -> b -> c uncurry :: (a -> b -> c) -> (a, b) -> c