Currying

In mathematics and computer science, currying is the technique of translating a function that takes multiple arguments into a sequence of families of functions, each taking a single argument.
In the prototypical example, one begins with a function f : ( X × Y ) → Z {\displaystyle f:(X\times Y)\to Z} that takes two arguments, one from X {\displaystyle X} and one from Y , {\displaystyle Y,} and produces objects in Z . {\displaystyle Z.} The curried form of this function treats the first argument as a parameter, so as to create a family of functions f x : Y → Z . {\displaystyle f_{x}:Y\to Z.} The family is arranged so that for each object x {\displaystyle x} in X , {\displaystyle X,} there is exactly one function f x . {\displaystyle f_{x}.}
In this example, curry {\displaystyle {\mbox{curry}}} itself becomes a function, that takes f {\displaystyle f} as an argument, and returns a function that maps each x {\displaystyle x} to f x . {\displaystyle f_{x}.} The proper notation for expressing this is verbose. The function f {\displaystyle f} belongs to the set of functions ( X × Y ) → Z . {\displaystyle (X\times Y)\to Z.} Meanwhile, f x {\displaystyle f_{x}} belongs to the set of functions Y → Z . {\displaystyle Y\to Z.} Thus, something that maps x {\displaystyle x} to f x {\displaystyle f_{x}} will be of the type X → [ Y → Z ] . {\displaystyle X\to [Y\to Z].} With this notation, curry {\displaystyle {\mbox{curry}}} is a function that takes objects from the first set, and returns objects in the second set, and so one writes curry : [ ( X × Y ) → Z ] → ( X → [ Y → Z ] ) . {\displaystyle {\mbox{curry}}:[(X\times Y)\to Z]\to (X\to [Y\to Z]).} This is a somewhat informal example; more precise definitions of what is meant by "object" and "function" are given below. These definitions vary from context to context, and take different forms, depending on the theory that one is working in.
Currying is related to, but not the same as, partial application. The example above can be used to illustrate partial application; it is quite similar. Partial application is the function apply {\displaystyle {\mbox{apply}}} that takes the pair f {\displaystyle f} and x {\displaystyle x} together as arguments, and returns f x . {\displaystyle f_{x}.} Using the same notation as above, partial application has the signature apply : ( [ ( X × Y ) → Z ] × X ) → [ Y → Z ] . {\displaystyle {\mbox{apply}}:([(X\times Y)\to Z]\times X)\to [Y\to Z].} Written this way, application can be seen to be adjoint to currying.
The currying of a function with more than two arguments can be defined by induction.
Currying is useful in both practical and theoretical settings. In functional programming languages, and many others, it provides a way of automatically managing how arguments are passed to functions and exceptions. In theoretical computer science, it provides a way to study functions with multiple arguments in simpler theoretical models which provide only one argument. The most general setting for the strict notion of currying and uncurrying is in the closed monoidal categories, which underpins a vast generalization of the Curry–Howard correspondence of proofs and programs to a correspondence with many other structures, including quantum mechanics, cobordisms and string theory.
The concept of currying was introduced by Gottlob Frege, developed by Moses Schönfinkel, and further developed by Haskell Curry.
Uncurrying is the dual transformation to currying, and can be seen as a form of defunctionalization. It takes a function f {\displaystyle f} whose return value is another function g {\displaystyle g} , and yields a new function f ′ {\displaystyle f'} that takes as parameters the arguments for both f {\displaystyle f} and g {\displaystyle g} , and returns, as a result, the application of f {\displaystyle f} and subsequently, g {\displaystyle g} , to those arguments. The process can be iterated.
Currying provides a way for working with functions that take multiple arguments, and using them in frameworks where functions might take only one argument. For example, some analytical techniques can only be applied to functions with a single argument. Practical functions frequently take more arguments than this. Frege showed that it was sufficient to provide solutions for the single argument case, as it was possible to transform a function with multiple arguments into a chain of single-argument functions instead. This transformation is the process now known as currying. All "ordinary" functions that might typically be encountered in mathematical analysis or in computer programming can be curried. However, there are categories in which currying is not possible; the most general categories which allow currying are the closed monoidal categories.
Some programming languages almost always use curried functions to achieve multiple arguments; notable examples are ML and Haskell, where in both cases all functions have exactly one argument. This property is inherited from lambda calculus, where multi-argument functions are usually represented in curried form.
Currying is related to, but not the same as partial application. In practice, the programming technique of closures can be used to perform partial application and a kind of currying, by hiding arguments in an environment that travels with the curried function.
The "Curry" in "Currying" is a reference to logician Haskell Curry, who used the concept extensively, but Moses Schönfinkel had the idea six years before Curry. The alternative name "Schönfinkelisation" has been proposed. In the mathematical context, the principle can be traced back to work in 1893 by Frege.
The originator of the word "currying" is not clear. David Turner says the word was coined by Christopher Strachey in his 1967 lecture notes Fundamental Concepts in Programming Languages, but that source introduces the concept as "a device originated by Schönfinkel", and the term "currying" is not used, while Curry is mentioned later in the context of higher-order functions. John C. Reynolds defined "currying" in a 1972 paper, but did not claim to have coined the term.
Currying is most easily understood by starting with an informal definition, which can then be molded to fit many different domains. First, there is some notation to be established. The notation X → Y {\displaystyle X\to Y} denotes all functions from X {\displaystyle X} to Y {\displaystyle Y} . If f {\displaystyle f} is such a function, we write f : X → Y {\displaystyle f\colon X\to Y} . Let X × Y {\displaystyle X\times Y} denote the ordered pairs of the elements of X {\displaystyle X} and Y {\displaystyle Y} respectively, that is, the Cartesian product of X {\displaystyle X} and Y {\displaystyle Y} . Here, X {\displaystyle X} and Y {\displaystyle Y} may be sets, or they may be types, or they may be other kinds of objects, as explored below.
Given a function
currying constructs a new function
That is, g {\displaystyle g} takes an argument of type X {\displaystyle X} and returns a function of type Y → Z {\displaystyle Y\to Z} . It is defined by
for x {\displaystyle x} of type X {\displaystyle X} and y {\displaystyle y} of type Y {\displaystyle Y} . We then also write
Uncurrying is the reverse transformation, and is most easily understood in terms of its right adjoint, the function apply . {\displaystyle \operatorname {apply} .}
In set theory, the notation Y X {\displaystyle Y^{X}} is used to denote the set of functions from the set X {\displaystyle X} to the set Y {\displaystyle Y} . Currying is the natural bijection between the set A B × C {\displaystyle A^{B\times C}} of functions from B × C {\displaystyle B\times C} to A {\displaystyle A} , and the set ( A C ) B {\displaystyle (A^{C})^{B}} of functions from B {\displaystyle B} to the set of functions from C {\displaystyle C} to A {\displaystyle A} . In symbols:
Indeed, it is this natural bijection that justifies the exponential notation for the set of functions. As is the case in all instances of currying, the formula above describes an adjoint pair of functors: for every fixed set C {\displaystyle C} , the functor B ↦ B × C {\displaystyle B\mapsto B\times C} is left adjoint to the functor A ↦ A C {\displaystyle A\mapsto A^{C}} .
In the category of sets, the object Y X {\displaystyle Y^{X}} is called the exponential object.
In the theory of function spaces, such as in functional analysis or homotopy theory, one is commonly interested in continuous functions between topological spaces. One writes Hom ( X , Y ) {\displaystyle {\text{Hom}}(X,Y)} (the Hom functor) for the set of all functions from X {\displaystyle X} to Y {\displaystyle Y} , and uses the notation Y X {\displaystyle Y^{X}} to denote the subset of continuous functions. Here, curry {\displaystyle {\text{curry}}} is the bijection
while uncurrying is the inverse map. If the set Y X {\displaystyle Y^{X}} of continuous functions from X {\displaystyle X} to Y {\displaystyle Y} is given the compact-open topology, and if the space Y {\displaystyle Y} is locally compact Hausdorff, then
is a homeomorphism. This is also the case when X {\displaystyle X} , Y {\displaystyle Y} and Y X {\displaystyle Y^{X}} are compactly generated, although there are more cases.
One useful corollary is that a function is continuous if and only if its curried form is continuous. Another important result is that the application map, usually called "evaluation" in this context, is continuous (note that eval is a strictly different concept in computer science.) That is,
eval : Y X × X → Y ( f , x ) ↦ f ( x ) {\displaystyle {\begin{aligned}&&{\text{eval}}:Y^{X}\times X\to Y\\&&(f,x)\mapsto f(x)\end{aligned}}}
is continuous when Y X {\displaystyle Y^{X}} is compact-open and Y {\displaystyle Y} locally compact Hausdorff. These two results are central for establishing the continuity of homotopy, i.e. when X {\displaystyle X} is the unit interval I {\displaystyle I} , so that Z I × Y ≅ ( Z Y ) I {\displaystyle Z^{I\times Y}\cong (Z^{Y})^{I}} can be thought of as either a homotopy of two functions from Y {\displaystyle Y} to Z {\displaystyle Z} , or, equivalently, a single (continuous) path in Z Y {\displaystyle Z^{Y}} .
In algebraic topology, currying serves as an example of Eckmann–Hilton duality, and, as such, plays an important role in a variety of different settings. For example, loop space is adjoint to reduced suspensions; this is commonly written as
where [ A , B ] {\displaystyle [A,B]} is the set of homotopy classes of maps A → B {\displaystyle A\rightarrow B} , and Σ A {\displaystyle \Sigma A} is the suspension of A, and Ω A {\displaystyle \Omega A} is the loop space of A. In essence, the suspension Σ X {\displaystyle \Sigma X} can be seen as the cartesian product of X {\displaystyle X} with the unit interval, modulo an equivalence relation to turn the interval into a loop. The curried form then maps the space X {\displaystyle X} to the space of functions from loops into Z {\displaystyle Z} , that is, from X {\displaystyle X} into Ω Z {\displaystyle \Omega Z} . Then curry {\displaystyle {\text{curry}}} is the adjoint functor that maps suspensions to loop spaces, and uncurrying is the dual.
The duality between the mapping cone and the mapping fiber (cofibration and fibration) can be understood as a form of currying, which in turn leads to the duality of the long exact and coexact Puppe sequences.
In homological algebra, the relationship between currying and uncurrying is known as tensor-hom adjunction. Here, an interesting twist arises: the Hom functor and the tensor product functor might not lift to an exact sequence; this leads to the definition of the Ext functor and the Tor functor.
In order theory, that is, the theory of lattices of partially ordered sets, curry {\displaystyle {\text{curry}}} is a continuous function when the lattice is given the Scott topology. Scott-continuous functions were first investigated in the attempt to provide a semantics for lambda calculus (as ordinary set theory is inadequate to do this). More generally, Scott-continuous functions are now studied in domain theory, which encompasses the study of denotational semantics of computer algorithms. Note that the Scott topology is quite different than many common topologies one might encounter in the category of topological spaces; the Scott topology is typically finer, and is not sober.
The notion of continuity makes its appearance in homotopy type theory, where, roughly speaking, two computer programs can be considered to be homotopic, i.e. compute the same results, if they can be "continuously" refactored from one to the other.
In theoretical computer science, currying provides a way to study functions with multiple arguments in very simple theoretical models, such as the lambda calculus, in which functions only take a single argument. Consider a function f ( x , y ) {\displaystyle f(x,y)} taking two arguments, and having the type ( X × Y ) → Z {\displaystyle (X\times Y)\to Z} , which should be understood to mean that x must have the type X {\displaystyle X} , y must have the type Y {\displaystyle Y} , and the function itself returns the type Z {\displaystyle Z} . The curried form of f is defined as
where λ {\displaystyle \lambda } is the abstractor of lambda calculus. Since curry takes, as input, functions with the type ( X × Y ) → Z {\displaystyle (X\times Y)\to Z} , one concludes that the type of curry itself is
The → operator is often considered right-associative, so the curried function type X → ( Y → Z ) {\displaystyle X\to (Y\to Z)} is often written as X → Y → Z {\displaystyle X\to Y\to Z} . Conversely, function application is considered to be left-associative, so that f ( x , y ) {\displaystyle f(x,y)} is equivalent to
That is, the parenthesis are not required to disambiguate the order of the application.
Curried functions may be used in any programming language that supports closures; however, uncurried functions are generally preferred for efficiency reasons, since the overhead of partial application and closure creation can then be avoided for most function calls.
In type theory, the general idea of a type system in computer science is formalized into a specific algebra of types. For example, when writing f : X → Y {\displaystyle f\colon X\to Y} , the intent is that X {\displaystyle X} and Y {\displaystyle Y} are types, while the arrow → {\displaystyle \to } is a type constructor, specifically, the function type or arrow type. Similarly, the Cartesian product X × Y {\displaystyle X\times Y} of types is constructed by the product type constructor × {\displaystyle \times } .
The type-theoretical approach is expressed in programming languages such as ML and the languages derived from and inspired by it: Caml, Haskell, and F#.
The type-theoretical approach provides a natural complement to the language of category theory, as discussed below. This is because categories, and specifically, monoidal categories, have an internal language, with simply typed lambda calculus being the most prominent example of such a language. It is important in this context, because it can be built from a single type constructor, the arrow type. Currying then endows the language with a natural product type. The correspondence between objects in categories and types then allows programming languages to be re-interpreted as logics (via Curry–Howard correspondence), and as other types of mathematical systems, as explored further, below.
Under the Curry–Howard correspondence, the existence of currying and uncurrying is equivalent to the logical theorem ( ( A ∧ B ) → C ) ⇔ ( A → ( B → C ) ) {\displaystyle ((A\land B)\to C)\Leftrightarrow (A\to (B\to C))} (also known as exportation), as tuples (product type) corresponds to conjunction in logic, and function type corresponds to implication.
The exponential object Q P {\displaystyle Q^{P}} in the category of Heyting algebras is normally written as material implication P → Q {\displaystyle P\to Q} . Distributive Heyting algebras are Boolean algebras, and the exponential object has the explicit form ¬ P ∨ Q {\displaystyle \neg P\lor Q} , thus making it clear that the exponential object really is material implication.
The above notions of currying and uncurrying find their most general, abstract statement in category theory. Currying is a universal property of an exponential object, and gives rise to an adjunction in cartesian closed categories. That is, there is a natural isomorphism between the morphisms from a binary product f : ( X × Y ) → Z {\displaystyle f\colon (X\times Y)\to Z} and the morphisms to an exponential object g : X → Z Y {\displaystyle g\colon X\to Z^{Y}} .
This generalizes to a broader result in closed monoidal categories: Currying is the statement that the tensor product and the internal Hom are adjoint functors; that is, for every object B {\displaystyle B} there is a natural isomorphism:
Here, Hom denotes the (external) Hom-functor of all morphisms in the category, while B ⇒ C {\displaystyle B\Rightarrow C} denotes the internal hom functor in the closed monoidal category. For the category of sets, the two are the same. When the product is the cartesian product, then the internal hom B ⇒ C {\displaystyle B\Rightarrow C} becomes the exponential object C B {\displaystyle C^{B}} .
Currying can break down in one of two ways. One is if a category is not closed, and thus lacks an internal hom functor (possibly because there is more than one choice for such a functor). Another way is if it is not monoidal, and thus lacks a product (that is, lacks a way of writing down pairs of objects). Categories that do have both products and internal homs are exactly the closed monoidal categories.
The setting of cartesian closed categories is sufficient for the discussion of classical logic; the more general setting of closed monoidal categories is suitable for quantum computation.
The difference between these two is that the product for cartesian categories (such as the category of sets, complete partial orders or Heyting algebras) is just the Cartesian product; it is interpreted as an ordered pair of items (or a list). Simply typed lambda calculus is the internal language of cartesian closed categories; and it is for this reason that pairs and lists are the primary types in the type theory of LISP, Scheme and many functional programming languages.
By contrast, the product for monoidal categories (such as Hilbert space and the vector spaces of functional analysis) is the tensor product. The internal language of such categories is linear logic, a form of quantum logic; the corresponding type system is the linear type system. Such categories are suitable for describing entangled quantum states, and, more generally, allow a vast generalization of the Curry–Howard correspondence to quantum mechanics, to cobordisms in algebraic topology, and to string theory. The linear type system, and linear logic are useful for describing synchronization primitives, such as mutual exclusion locks, and the operation of vending machines.
Currying and partial function application are often conflated. One of the significant differences between the two is that a call to a partially applied function returns the result right away, not another function down the currying chain; this distinction can be illustrated clearly for functions whose arity is greater than two.
Given a function of type f : ( X × Y × Z ) → N {\displaystyle f\colon (X\times Y\times Z)\to N} , currying produces curry ( f ) : X → ( Y → ( Z → N ) ) {\displaystyle {\text{curry}}(f)\colon X\to (Y\to (Z\to N))} . That is, while an evaluation of the first function might be represented as f ( 1 , 2 , 3 ) {\displaystyle f(1,2,3)} , evaluation of the curried function would be represented as f curried ( 1 ) ( 2 ) ( 3 ) {\displaystyle f_{\text{curried}}(1)(2)(3)} , applying each argument in turn to a single-argument function returned by the previous invocation. Note that after calling f curried ( 1 ) {\displaystyle f_{\text{curried}}(1)} , we are left with a function that takes a single argument and returns another function, not a function that takes two arguments.
In contrast, partial function application refers to the process of fixing a number of arguments to a function, producing another function of smaller arity. Given the definition of f {\displaystyle f} above, we might fix (or 'bind') the first argument, producing a function of type partial ( f ) : ( Y × Z ) → N {\displaystyle {\text{partial}}(f)\colon (Y\times Z)\to N} . Evaluation of this function might be represented as f partial ( 2 , 3 ) {\displaystyle f_{\text{partial}}(2,3)} . Note that the result of partial function application in this case is a function that takes two arguments.
Intuitively, partial function application says "if you fix the first argument of the function, you get a function of the remaining arguments". For example, if function div stands for the division operation x/y, then div with the parameter x fixed at 1 (i.e., div 1) is another function: the same as the function inv that returns the multiplicative inverse of its argument, defined by inv(y) = 1/y.
The practical motivation for partial application is that very often the functions obtained by supplying some but not all of the arguments to a function are useful; for example, many languages have a function or operator similar to plus_one. Partial application makes it easy to define these functions, for example by creating a function that represents the addition operator with 1 bound as its first argument.
Partial application can be seen as evaluating a curried function at a fixed point, e.g. given f : ( X × Y × Z ) → N {\displaystyle f\colon (X\times Y\times Z)\to N} and a ∈ X {\displaystyle a\in X} then curry ( partial ( f ) a ) ( y ) ( z ) = curry ( f ) ( a ) ( y ) ( z ) {\displaystyle {\text{curry}}({\text{partial}}(f)_{a})(y)(z)={\text{curry}}(f)(a)(y)(z)} or simply partial ( f ) a = curry 1 ( f ) ( a ) {\displaystyle {\text{partial}}(f)_{a}={\text{curry}}_{1}(f)(a)} where curry 1 {\displaystyle {\text{curry}}_{1}} curries f's first parameter.
Thus, partial application is reduced to a curried function at a fixed point. Further, a curried function at a fixed point is (trivially), a partial application. For further evidence, note that, given any function f ( x , y ) {\displaystyle f(x,y)} , a function g ( y , x ) {\displaystyle g(y,x)} may be defined such that g ( y , x ) = f ( x , y ) {\displaystyle g(y,x)=f(x,y)} . Thus, any partial application may be reduced to a single curry operation. As such, curry is more suitably defined as an operation which, in many theoretical cases, is often applied recursively, but which is theoretically indistinguishable (when considered as an operation) from a partial application.
So, a partial application can be defined as the objective result of a single application of the curry operator on some ordering of the inputs of some function.