curry -package:dimensional

curry :: ((a, b) -> c) -> a -> b -> c
base Prelude Data.Tuple, relude Relude.Container.Reexport, ghc-internal GHC.Internal.Data.Tuple, verset Verset
Convert an uncurried function to a curried function.

Examples

>>> curry fst 1 2
1
curry :: ((a, b) -> c) -> a -> b -> c
hedgehog Hedgehog.Internal.Prelude, extra Data.Tuple.Extra, base-compat Data.Tuple.Compat Prelude.Compat, protolude Protolude, rio RIO.Prelude, base-prelude BasePrelude, classy-prelude ClassyPrelude, numeric-prelude NumericPrelude NumericPrelude.Base, Cabal-syntax Distribution.Compat.Prelude, universum Universum.Container.Reexport, ihaskell IHaskellPrelude, numhask NumHask.Prelude, base-compat-batteries Data.Tuple.Compat, clash-prelude Clash.HaskellPrelude, foundation Foundation, ghc-lib-parser GHC.Prelude.Basic, rebase Rebase.Prelude, mixed-types-num Numeric.MixedTypes.PreludeHiding, xmonad-contrib XMonad.Config.Prime, constrained-categories Control.Category.Hask, copilot-language Copilot.Language.Prelude, incipit-base Incipit.Base, LambdaHack Game.LambdaHack.Core.Prelude, cabal-install-solver Distribution.Solver.Compat.Prelude, faktory Faktory.Prelude, yesod-paginator Yesod.Paginator.Prelude, code-conjure Conjure.Utils, distribution-opensuse OpenSuse.Prelude, hledger-web Hledger.Web.Import, termonad Termonad.Prelude
curry converts an uncurried function to a curried function.

Examples

>>> curry fst 1 2
1
curry :: ((a, b) -> c) -> a -> b -> c
ghc GHC.Prelude.Basic
curry :: Applicative f => (f (a, b) -> g) -> f a -> f b -> g
utility-ht Control.Applicative.HT
curry :: (Pair a b -> c) -> a -> b -> c
strict Data.Strict.Tuple, yaya Yaya.Pattern, strict-base-types Data.Tuple.Strict
Curry a function on strict pairs.
curry :: ((a, b) -> c) -> a -> b -> c
basic-prelude CorePrelude
curry converts an uncurried function to a curried function.
curry :: HasRep ts => (HVect ts -> a) -> HVectElim ts a
hvect Data.HVect
curry :: () => ((a, b) -> c) -> a -> b -> c
prelude-compat Prelude2010
curry converts an uncurried function to a curried function.

Examples

>>> curry fst 1 2
1
curry :: (Curry k, ObjectPair k a b, ObjectMorphism k b c) => k (a, b) c -> k a (k b c)
constrained-categories Control.Category.Constrained Control.Category.Constrained.Prelude
curry :: ((a, b) -> c) <-> (a -> b -> c)
invertible Data.Invertible.Prelude Data.Invertible.Tuple
Convert between an uncurried function and a curryed function.
curry :: Natural n => (T n a -> b) -> Curried n a b
fixed-length Data.FixedLength
package curry
Uses
Not on Stackage, so not searched. Curry types
module Data.Vinyl.Curry
vinyl
Provides combinators for currying and uncurrying functions over arbitrary vinyl records.
type family Curry (xs :: IxList) (y :: Type) :: Type
optics-core Optics.Internal.Optic.TypeLevel Optics.Optic
Curry a type-level list. In pseudo (dependent-)Haskell: 
Curry xs y = foldr (->) y xs
module Data.Tuple.Curry
tuple
class Curry a b | a -> b
tuple Data.Tuple.Curry
Tuple curry/uncurry.
type family Curry (a1 :: (a, b) ~> c) (a2 :: a) (a3 :: b) :: c
singletons-base Data.Tuple.Singletons Prelude.Singletons
class (Cartesian k) => Curry k
constrained-categories Control.Category.Constrained Control.Category.Constrained.Prelude
module Data.Curry
swizzle
curry3 :: ((a, b, c) -> d) -> a -> b -> c -> d
extra Data.Tuple.Extra Extra
Converts an uncurried function to a curried function.
curry' :: Closed p => p (a, b) c -> p a (b -> c)
profunctors Data.Profunctor Data.Profunctor.Closed
curry3 :: Applicative f => (f (a, b, c) -> g) -> f a -> f b -> f c -> g
utility-ht Control.Applicative.HT
curry3 :: ((a, b, c) -> d) -> a -> b -> c -> d
utility-ht Data.Tuple.HT
curryRGB :: (RGB a -> b) -> a -> a -> a -> b
colour Data.Colour.RGBSpace
Curries a function expecting one RGB parameter.
currySigma :: forall a (b :: a ~> Type) (c :: Sigma a b ~> Type) . (forall (p :: Sigma a b) . SSigma p -> c @@ p) -> forall (x :: a) (sx :: Sing x) (y :: b @@ x) . Sing ('WrapSing sx) -> Sing y -> c @@ (sx ':&: y)
singletons Data.Singletons.Sigma
Convert an uncurried function on Sigma to a curried one. Together, currySigma and uncurrySigma witness an isomorphism such that the following identities hold: 
id1 :: forall a (b :: a ~> Type) (c :: Sigma a b ~> Type).
(forall (p :: Sigma a b). SSigma p -> c @ p)
-> (forall (p :: Sigma a b). SSigma p -> c  p)
id1 f = uncurrySigma a b c (currySigma a b c f)

id2 :: forall a (b :: a ~> Type) (c :: Sigma a b ~> Type).
(forall (x :: a) (sx :: Sing x) (y :: b  x). Sing (WrapSing sx) -> Sing y -> c  (sx :&: y))
-> (forall (x :: a) (sx :: Sing x) (y :: b  x). Sing (WrapSing sx) -> Sing y -> c  (sx :&: y))
id2 f = currySigma a b c (uncurrySigma a b @c f)