Currying
≈ 13 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In mathematics and computer science, currying (named after Haskell Curry) 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\times Y)\to Z that takes two arguments, one from X and one from Y, and produces objects in 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\to Z. The family is arranged so that for each object x in X, there is exactly one function f_x , such that for any y in Y , f_x(y) = f(x,y) . In this example, \mbox{curry} itself becomes a function that takes f as an argument, and returns a function that maps each x to f_x. The proper notation for expressing this is verbose. The function f belongs to the set of functions (X\times Y)\to Z. Meanwhile, f_x belongs to the set of functions Y\to Z. Thus, something that maps x to f_x will be of the type X\to [Y\to Z]. With this notation, \mbox{curry} is a function that takes objects from the first set, and returns objects in the second set, and so one writes \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.…
In mathematics and computer science, currying (named after Haskell Curry) 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\times Y)\to Z that takes two arguments, one from X and one from Y, and produces objects in 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\to Z. The family is arranged so that for each object x in X, there is exactly one function f_x , such that for any y in Y , f_x(y) = f(x,y) . In this example, \mbox{curry} itself becomes a function that takes f as an argument, and returns a function that maps each x to f_x. The proper notation for expressing this is verbose. The function f belongs to the set of functions (X\times Y)\to Z. Meanwhile, f_x belongs to the set of functions Y\to Z. Thus, something that maps x to f_x will be of the type X\to [Y\to Z]. With this notation, \mbox{curry} is a function that takes objects from the first set, and returns objects in the second set, and so one writes \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 \mbox{apply} that takes the pair f and x together as arguments, and returns f_x. Using the same notation as above, partial application has the signature \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 whose return value is another function g , and yields a new function f' that takes as parameters the arguments for both f and g , and returns, as a result, the application of f and subsequently, g , to those arguments. The process can be iterated. f \colon (X \times Y) \to Z , currying constructs a new function g \colon X \to (Y \to Z) . That is, g takes an argument of type X and returns a function of type Y\to Z . It is defined by g(x)(y)=f(x,y) for x of type X and y of type Y . We then also write \text{curry}(f)=g. Uncurrying is the reverse transformation, and is most easily understood in terms of its right adjoint, the function \operatorname{apply}. A^{B\times C}\cong (A^C)^B 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 , the functor B\mapsto B\times C is left adjoint to the functor A \mapsto A^C . In the category of sets, the object Y^X is called the exponential object. \text{curry}:\text{Hom}(X\times Y, Z) \to \text{Hom}(X, \text{Hom}(Y,Z)) , while uncurrying is the inverse map. If the set Y^X of continuous functions from X to Y is given the compact-open topology, and if the space Y is locally compact Hausdorff, then \text{curry} : Z^{X\times Y}\to (Z^Y)^X is a homeomorphism. This is also the case when X , Y and 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, \begin{align} &&\text{eval}:Y^X \times X \to Y \\ && (f,x) \mapsto f(x) \end{align} is continuous when Y^X is compact-open and Y locally compact Hausdorff. These two results are central for establishing the continuity of homotopy, i.e. when X is the unit interval I , so that Z^{I\times Y} \cong (Z^Y)^I can be thought of as either a homotopy of two functions from Y to Z , or, equivalently, a single (continuous) path in Z^Y . [\Sigma X,Z] \approxeq [X, \Omega Z] where [A,B] is the set of homotopy classes of maps A \rightarrow B , and \Sigma A is the suspension of A, and \Omega A is the loop space of A. In essence, the suspension \Sigma X can be seen as the cartesian product of X with the unit interval, modulo an equivalence relation to turn the interval into a loop. The curried form then maps the space X to the space of functions from loops into Z , that is, from X into \Omega Z . Then \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. \text{curry}(f) = \lambda x.(\lambda y.(f(x,y))) where \lambda is the abstractor of lambda calculus. Since curry takes, as input, functions with the type (X\times Y)\to Z , one concludes that the type of curry itself is \text{curry}:((X \times Y)\to Z) \to (X \to (Y \to Z)) The → operator is often considered right-associative, so the curried function type X \to (Y \to Z) is often written as X \to Y \to Z . Conversely, function application is considered to be left-associative, so that f(x, y) is equivalent to ((\text{curry}(f) \; x) \;y) = \text{curry}(f) \; x \;y. 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. \mathrm{Hom}(A\otimes B, C) \cong \mathrm{Hom}(A, B\Rightarrow C) . Here, Hom denotes the (external) Hom-functor of all morphisms in the category, while 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\Rightarrow C becomes the exponential object 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. 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 \colon (X \times Y \times Z) \to N and a \in X then \text{curry}(\text{partial}(f)_a)(y)(z) = \text{curry}(f)(a)(y)(z) or simply \text{partial}(f)_a = \text{curry}_1(f)(a) where \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) , a function g(y,x) may be defined such that 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.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1378651937 under CC BY-SA 4.0; modifications have been made.