View source for Currying

{{short description|Transforming a function in such a way that it only takes a single argument}}
{{about|the mathematical technique|the cooking process of this name|Curry|the leather finishing process|Currier|horse grooming|Currycomb}}
In [[mathematics]] and [[computer science]], '''currying''' is the technique of translating a [[Function (mathematics)|function]] that takes multiple [[Parameter (computer science)|arguments]] into a sequence of families of functions, each taking a single argument.

In the prototypical example, one begins with a function <math>f:(X\times Y)\to Z</math> that takes two arguments, one from <math>X</math> and one from <math>Y,</math> and produces objects in <math>Z.</math> The curried form of this function treats the first argument as a parameter, so as to create a family of functions <math>f_x :Y\to Z.</math> The family is arranged so that for each object <math>x</math> in <math>X,</math> there is exactly one function <math>f_x.</math> 

In this example, <math>\mbox{curry}</math> itself becomes a function, that takes <math>f</math> as an argument, and returns a function that maps each <math>x</math> to <math>f_x.</math> The proper notation for expressing this is verbose. The function <math>f</math> belongs to the set of functions <math>(X\times Y)\to Z.</math>  Meanwhile, <math>f_x</math> belongs to the set of functions <math>Y\to Z.</math> Thus, something that maps <math>x</math> to <math>f_x</math> will be of the type <math>X\to [Y\to Z].</math> With this notation, <math>\mbox{curry}</math> is a function that takes objects from the first set, and returns objects in the second set, and so one writes <math>\mbox{curry}:[(X\times Y)\to Z]\to (X\to [Y\to Z]).</math> 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]].<ref name="lambda-the-ultimate">{{Cite web |last=cdiggins |date=24 May 2007 |title=Currying != Generalized Partial Application?! |url=http://lambda-the-ultimate.org/node/2266 |access-date= |website=Lambda the Ultimate: The Programming Languages Weblog}}</ref><ref name="uncarved"/> The example above can be used to illustrate partial application; it is quite similar.  Partial application is the function <math>\mbox{apply}</math> that takes the pair <math>f</math> and <math>x</math> together as arguments, and returns <math>f_x.</math> Using the same notation as above, partial application has the signature <math>\mbox{apply}:([(X\times Y)\to Z] \times X) \to [Y\to Z].</math> 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]] [[Programming language|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 category|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.<ref name="rosetta"/>

The concept of currying was introduced by [[Gottlob Frege]],<ref name="Frege">{{Cite book |last=Frege |first=Gottlob |url=http://archive.org/details/bub_gb_LZ5tAAAAMAAJ |title=Grundgesetze der arithmetik |publisher=Hermann Pohle |others=Book from the collections of University of Wisconsin - Madison, digitized by Google on 26 August 2008 |year=1893 |publication-place=Jena |pages=54–55 |language=de |chapter=§ 36 |author-link=Gottlob Frege |chapter-url=https://archive.org/details/bub_gb_LZ5tAAAAMAAJ/page/n89}}</ref><ref name="quine">{{Cite book |last=Quine |first=W. V. |title=From Frege to Gödel: A Source Book in Mathematical Logic, 1879-1931 |publisher=Harvard University Press |year=1967 |isbn=9780674324497 |editor-last=van Heijenoort |editor-first=Jean |pages=355–357 |chapter=Introduction to Moses Schönfinkel's 1924 "On the building blocks of mathematical logic" |author-link=Willard Van Orman Quine}}</ref> developed by [[Moses Schönfinkel]],<ref>{{cite journal |last1=Schönfinkel |first1=Moses |author1-link=Moses Schönfinkel |date=September 1924 |orig-date=Presented at the Mathematischen Gesellschaft (Mathematical Society) in Göttingen on 7 December 1920. Received by Mathematische Annalen on 15 March 1924. |title=Über die Bausteine der mathematischen Logik |trans-title=On the building blocks of mathematical logic |url=http://www.cip.ifi.lmu.de/~langeh/test/1924%20-%20Schoenfinkel%20-%20Ueber%20die%20Bausteine%20der%20mathematischen%20Logik.pdf |journal=[[Mathematische Annalen]] |location=Moskau |publisher=Springer |publication-place=Berlin? |volume=92 |issue=3–4 |pages=305–316 |doi=10.1007/BF01448013 |s2cid=118507515}}</ref><ref name="quine"/><ref name="Strachey">{{Cite journal |last1=Strachey |first1=Christopher |author1-link=Christopher Strachey |date=April 2000 |orig-date=This paper forms the substance of a course of lectures given at the International Summer School in Computer Programming at Copenhagen in August, 1967. |title=Fundamental Concepts in Programming Languages |url=https://doi.org/10.1023/A:1010000313106 |journal=Higher-Order and Symbolic Computation |language=en |volume=13 |issue= |pages=11–49 |citeseerx=10.1.1.332.3161 |doi=10.1023/A:1010000313106 |issn=1573-0557 |s2cid=14124601 |quote=There is a device originated by Schönfinkel, for reducing operators with several operands to the successive application of single operand operators.}}</ref><ref name="Reynolds">Originally published as {{Cite book |last1=Reynolds |first1=John C. |author1-link=John C. Reynolds |chapter=Definitional interpreters for higher-order programming languages |editor1-last=Shields |editor1-first=Rosemary |title=Proceedings of the ACM annual conference - ACM '72 |date=1 August 1972 |chapter-url=http://portal.acm.org/citation.cfm?doid=800194.805852 |language=en |publisher=ACM Press |volume=2 |pages=717–740 |doi=10.1145/800194.805852 |isbn=9781450374927 |s2cid=163294 |url=https://surface.syr.edu/lcsmith_other/13 |quote=In the last line we have used a trick called Currying (after the logician H. Curry) to solve the problem of introducing a binary operation into a language where all functions must accept a single argument. (The referee comments that although "Currying" is tastier, "Schönfinkeling” might be more accurate.)}}

Republished as {{Cite journal |last1=Reynolds |first1=John C. |author1-link=John C. Reynolds |date=1998 |title=Definitional Interpreters for Higher-Order Programming Languages |url=https://surface.syr.edu/cgi/viewcontent.cgi?article=1012&context=lcsmith_other |journal=Higher-Order and Symbolic Computation |publisher=Kluwer Academic Publishers |publication-place=Boston |volume=11 |issue=4 |pages=363–397 |doi=10.1023/A:1010027404223 |id=13 |via=Syracuse University: College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects}}</ref><ref>{{Cite book |last1=Slonneger |first1=Kenneth |last2=Kurtz |first2=Barry L. |year=1995 |url=https://cdn.preterhuman.net/texts/science_and_technology/artificial_intelligence/Formal%20Syntax%20and%20Semantics%20of%20Programming%20Languages%20-%20Kenneth%20Slonneger.pdf#page=161 |title=Formal Syntax and Semantics of Programming Languages: A Laboratory Based Approach |publisher=Addison-Wesley Publishing Company |isbn=0-201-65697-3 |page=144 |chapter=Curried Functions, 5.1: Concepts and Examples, Chapter 5: The Lambda Calculus}}</ref><ref name="haskell"/><ref>{{Cite web |date=6 May 2012 |title=Currying Schonfinkelling |url=http://wiki.c2.com/?CurryingSchonfinkelling |access-date= |website=[[Portland Pattern Repository]] Wiki |publisher=Cunningham & Cunningham, Inc.}}</ref>
and further developed by [[Haskell Curry]].<ref name="Reynolds"/><ref name="haskell"/><ref>{{Cite book |last1=Barendregt |first1=Henk |url=https://www.cse.chalmers.se/research/group/logic/TypesSS05/Extra/geuvers.pdf |title=Introduction to Lambda Calculus |last2=Barendsen |first2=Erik |date=March 2000 |edition=Revised |page=8 |orig-date=December 1998}}</ref><ref>{{cite book |last1=Curry |first1=Haskell |author1-link=Haskell Curry |last2=Feys |first2=Robert |title=Combinatory logic |publisher=North-Holland Publishing Company |volume=I |edition=2 |year=1958 |location=Amsterdam, Netherlands}}</ref>

'''Uncurrying''' is the [[Duality (mathematics)|dual]] transformation to currying, and can be seen as a form of [[defunctionalization]]. It takes a [[function (mathematics)|function]] <math>f</math> whose return value is another function <math>g</math>, and yields a new function <math>f'</math> that takes as parameters the arguments for both <math>f</math> and <math>g</math>, and returns, as a result, the application of <math>f</math> and subsequently, <math>g</math>, to those arguments. The process can be iterated.

==Motivation==
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 [[#Definition|analytical techniques]] can only be applied to [[function (mathematics)|function]]s with a single argument. Practical functions frequently take more arguments than this. [[Gottlob Frege|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.<ref>{{cite web |author= |date=November 2002 |editor-last=Hutton |editor-first=Graham |editor2-last=Jones |editor2-first=Mark P. |title=Frequently Asked Questions for comp.lang.functional, 3. Technical topics, 3.2. Currying |url=http://www.cs.nott.ac.uk/~gmh/faq.html#currying |url-status= |archive-url= |archive-date= |work=University of Nottingham Computer Science}}</ref> 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 category|closed monoidal categories]].

Some [[programming language]]s almost always use curried functions to achieve multiple arguments; notable examples are [[ML (programming language)|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]].<ref name="lambda-the-ultimate"/><ref name="uncarved"/> In practice, the programming technique of [[Closure (computer programming)|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.

== History ==
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.<ref name="haskell">{{cite journal |last1=Curry |first1=Haskell B. |author1-link=Haskell Curry |date=1980 |editor-last=Barwise |editor-first=Jon |editor2-last=Keisler |editor2-first=H. Jerome |editor3-last=Kunen |editor3-first=Kenneth |title=Some Philosophical Aspects of Combinatory Logic |journal=The Kleene Symposium: Proceedings of the Symposium Held June 18-24, 1978 at Madison, Wisconsin, U.S.A. (Studies in Logic and the Foundations of Mathematics) |series=Studies in Logic and the Foundations of Mathematics |publisher=North-Holland Publishing Company, imprint of Elsevier |volume=101 |pages=85–101 |doi=10.1016/S0049-237X(08)71254-0 |isbn=9780444853455 |issn=0049-237X |s2cid=117179133 |quote=Some contemporary logicians call this way of looking at a function "currying", because I made extensive use of it; but Schönfinkel had the idea some 6 years before I did.}}</ref> The alternative name "Schönfinkelisation" has been proposed.<ref>{{Cite book |last1=Heim |first1=Irene |url=https://cs.brown.edu/courses/csci2951-k/papers/heim00.pdf |title=Semantics in Generative Grammar |last2=Kratzer |first2=Angelika |date=January 2, 1998 |publisher=Blackwell Publishers, an imprint of Wiley |year=1998 |isbn=0-631-19712-5 |publication-place=Malden, Massachusetts |language=en}}</ref> In the mathematical context, the principle can be traced back to work in 1893 by [[Gottlob Frege|Frege]].<ref name=Frege/><ref name="quine"/>

The originator of the word "currying" is not clear. [[David Turner (computer scientist)|David Turner]] says the word was coined by [[Christopher Strachey]] in his 1967 lecture notes [[Fundamental Concepts in Programming Languages]],<ref>{{cite web |last1=Turner |first1=David |date=1 Jun 1997 |title=Programming language, Currying, or Schonfinkeling?, #9 / 14 |url=http://computer-programming-forum.com/26-programming-language/976f118bb90d8b15.htm |url-status=live |archive-url=https://web.archive.org/web/20220303194614/http://computer-programming-forum.com/26-programming-language/976f118bb90d8b15.htm |archive-date=3 March 2022 |access-date=3 March 2022 |website=Computer Programming Language Forum}}</ref> 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.<ref name=Strachey/> [[John C. Reynolds]] defined "currying" in a 1972 paper, but did not claim to have coined the term.<ref name=Reynolds/>

== Definition ==
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 <math>X \to Y </math> denotes all [[Function (mathematics)|functions]] from <math>X</math> to <math>Y</math>. If <math>f</math> is such a function, we write <math>f \colon X \to Y </math>. Let <math>X \times Y</math> denote the [[ordered pair]]s of the elements of <math>X</math> and <math>Y</math> respectively, that is, the [[Cartesian product]] of <math>X</math> and <math>Y</math>. Here, <math>X</math> and <math>Y</math> may be sets, or they may be types, or they may be other kinds of objects, as explored below.

Given a function

:<math>f \colon (X \times Y) \to Z </math>,

'''currying''' constructs a new function

:<math>g \colon X \to (Y \to Z) </math>.

That is, <math>g</math> takes an argument of type <math>X</math> and returns a function of type <math>Y\to Z</math>. It is defined by

:<math>g(x)(y)=f(x,y)</math>

for <math>x</math> of type <math>X</math> and <math>y</math> of type <math>Y</math>. We then also write

:<math>\text{curry}(f)=g.</math>

'''Uncurrying''' is the reverse transformation, and is most easily understood in terms of its right adjoint, the [[apply|function <math>\operatorname{apply}.</math>]]

=== Set theory ===
In [[set theory]], the notation <math>Y^X</math> is used to denote the [[set (mathematics)|set]] of functions from the set <math>X</math> to the set <math>Y</math>. Currying is the [[natural equivalence|natural bijection]] between the set <math>A^{B\times C}</math> of functions from <math>B\times C</math> to <math>A</math>, and the set <math>(A^C)^B</math> of functions from <math>B</math> to the set of functions from <math>C</math> to <math>A</math>. In symbols:

:<math>A^{B\times C}\cong (A^C)^B</math>

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 functors|adjoint pair of functors]]: for every fixed set <math>C</math>, the functor <math>B\mapsto B\times C</math> is left adjoint to the functor <math>A \mapsto A^C</math>.

In the [[category of sets]], the [[Mathematical object|object]] <math>Y^X</math> is called the [[exponential object]].

=== Function spaces ===
In the theory of [[function space]]s, such as in [[functional analysis]] or [[homotopy theory]], one is commonly interested in [[continuous function]]s between [[topological space]]s. One writes <math>\text{Hom}(X,Y)</math> (the [[Hom functor]]) for the set of ''all'' functions from <math>X</math> to <math>Y</math>, and uses the notation <math>Y^X</math> to denote the subset of continuous functions. Here, <math>\text{curry}</math> is the [[bijection]]

:<math>\text{curry}:\text{Hom}(X\times Y, Z) \to \text{Hom}(X, \text{Hom}(Y,Z)) ,</math>

while uncurrying is the inverse map. If the set <math>Y^X</math> of continuous functions from <math>X</math> to <math>Y</math> is given the [[compact-open topology]], and if the space <math>Y</math> is [[locally compact Hausdorff]], then

:<math>\text{curry} : Z^{X\times Y}\to (Z^Y)^X</math>

is a [[homeomorphism]]. This is also the case when <math>X</math>, <math>Y</math> and <math>Y^X</math> are [[Compactly generated space|compactly generated]],<ref name="may">{{Cite book |last=May |first=Jon Peter |url=http://www.math.uchicago.edu/~may/CONCISE/ConciseRevised.pdf |title=A concise course in algebraic topology |date=1999 |publisher=University of Chicago Press |isbn=0-226-51183-9 |edition= |series=Chicago lectures in mathematics |location=Chicago, Ill. |pages=39–55 |oclc=41266205}}</ref>{{rp|at=chapter 5}}<ref>{{Cite web |date=28 May 2023 |title=compactly generated topological space |url=https://ncatlab.org/nlab/show/compactly+generated+topological+space |access-date= |website=nLab}}</ref> although there are more cases.<ref>{{Cite journal |last1=Tillotson |first1=J. |last2=Booth |first2=Peter I. |orig-date=Received 2 October 1978, revised 29 June 1979, published 1 May 1980 |title=Monoidal closed, Cartesian closed and convenient categories of topological spaces |url=https://msp.org/pjm/1980/88-1/pjm-v88-n1-p03-s.pdf |journal=Pacific Journal of Mathematics |location=Memorial University of Newfoundland |publisher=Mathematical Sciences Publishers |publication-place=Berkeley, California |publication-date=March 1980 |volume=88 |issue=1 |pages=35–53 |doi=10.2140/pjm.1980.88.35 |issn=0030-8730 |eissn=1945-5844}}</ref><ref>{{Cite web |date=11 August 2023 |title=convenient category of topological spaces |url=https://ncatlab.org/nlab/show/convenient+category+of+topological+spaces |access-date= |website=nLab}}</ref>

One useful corollary is that a function is continuous [[if and only if]] its curried form is continuous. Another important result is that the [[apply|application map]], usually called "evaluation" in this context, is continuous (note that [[eval]] is a strictly different concept in computer science.) That is,

<math>\begin{align} &&\text{eval}:Y^X \times X \to Y \\
                     && (f,x) \mapsto f(x) \end{align}</math>

is continuous when <math>Y^X</math> is compact-open and <math>Y</math> locally compact Hausdorff.<ref name="rotman">{{Cite book |last=Rotman |first=Joseph Jonah |url=https://books.google.com/books?id=waq9mwUmcQgC |title=An introduction to algebraic topology |date=1988 |publisher=Springer-Verlag |isbn=978-0-387-96678-6 |series=Graduate texts in mathematics; 119 |location=New York |chapter=Chapter 11 |oclc=17383909}}</ref> These two results are central for establishing the continuity of [[homotopy]], i.e. when <math>X</math> is the unit interval <math>I</math>, so that <math>Z^{I\times Y} \cong (Z^Y)^I</math> can be thought of as either a homotopy of two functions from <math>Y</math> to <math>Z</math>, or, equivalently, a single (continuous) path in <math>Z^Y</math>.

=== Algebraic topology ===
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 suspension]]s; this is commonly written as
:<math>[\Sigma X,Z] \approxeq [X, \Omega Z]</math>
where <math>[A,B]</math> is the set of [[homotopy class]]es of maps <math>A \rightarrow B</math>, and <math>\Sigma A</math> is the [[Suspension (topology)|suspension]] of ''A'', and <math>\Omega A</math> is the [[loop space]] of ''A''. In essence, the suspension <math>\Sigma X</math> can be seen as the cartesian product of <math>X</math> with the unit interval, modulo an equivalence relation to turn the interval into a loop. The curried form then maps the space <math>X</math> to the space of functions from loops into <math>Z</math>, that is, from <math>X</math> into <math>\Omega Z</math>.<ref name=rotman/> Then <math>\text{curry}</math> is the [[adjoint functor]] that maps suspensions to loop spaces, and uncurrying is the dual.<ref name=rotman/>

The duality between the [[mapping cone (topology)|mapping cone]] and the mapping fiber ([[cofibration]] and [[fibration]])<ref name=may/>{{rp|at=chapters 6,7}} can be understood as a form of currying, which in turn leads to the duality of the [[long exact sequence|long exact]] and coexact [[Puppe sequence]]s.

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 (mathematics)|lift]] to an [[exact sequence]]; this leads to the definition of the [[Ext functor]] and the [[Tor functor]].

=== Domain theory ===
In [[order theory]], that is, the theory of [[lattice (order)|lattices]] of [[partially ordered set]]s, <math>\text{curry}</math> is a [[continuous function]] when the lattice is given the [[Scott topology]].<ref>{{Cite book |last=Barendregt |first=Hendrik Pieter |title=The lambda calculus: its syntax and semantics |date=1984 |publisher=North-Holland, an imprint of Elsevier |isbn=978-0-444-87508-2 |edition=Rev. |series=Studies in logic and the foundations of mathematics |volume=103 |location= |chapter=Theorems 1.2.13, 1.2.14}}</ref> 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 [[final topology|finer]], and is not [[sober space|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" [[code refactoring|refactored]] from one to the other.

=== Lambda calculi ===
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 <math>f(x,y)</math> taking two arguments, and having the type <math>(X \times Y)\to Z</math>, which should be understood to mean that ''x'' must have the type <math>X</math>, ''y'' must have the type <math>Y</math>, and the function itself returns the type <math>Z</math>. The curried form of ''f'' is defined as

:<math>\text{curry}(f) = \lambda x.(\lambda y.(f(x,y)))</math>

where <math>\lambda</math> is the abstractor of lambda calculus. Since curry takes, as input, functions with the type <math>(X\times Y)\to Z</math>, one concludes that the type of curry itself is

:<math>\text{curry}:((X \times Y)\to Z) \to (X \to (Y \to Z))</math>

The → operator is often considered [[right-associative]], so the curried function type <math>X \to (Y \to Z)</math> is often written as <math>X \to Y \to Z</math>. Conversely, [[function application]] is considered to be [[Operator associativity|left-associative]], so that <math>f(x, y)</math> is equivalent to

:<math>((\text{curry}(f) \; x) \;y) = \text{curry}(f) \; x \;y</math>.

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 [[closure (computer science)|closure]]s; 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.

=== Type theory ===
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 <math>f \colon X \to Y </math>, the intent is that <math>X</math> and <math>Y</math> are [[type system|types]], while the arrow <math>\to</math> is a [[type constructor]], specifically, the [[function type]] or arrow type. Similarly, the Cartesian product <math>X \times Y</math> of types is constructed by the [[product type]] constructor <math>\times</math>.

The type-theoretical approach is expressed in programming languages such as [[ML (programming language)|ML]] and the languages derived from and inspired by it: [[Caml]], [[Haskell]], and [[F Sharp (programming language)|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.

=== Logic ===
Under the [[Curry–Howard correspondence]], the existence of currying and uncurrying is equivalent to the logical theorem <math>((A \land B) \to C) \Leftrightarrow (A \to (B \to C))</math> (also known as [[Exportation (logic)|exportation]]), as [[tuple]]s ([[product type]]) corresponds to conjunction in logic, and function type corresponds to implication.

The [[exponential object]] <math>Q^P</math> in the category of [[Heyting algebra]]s is normally written as [[Material conditional|material implication]] <math>P\to Q</math>. Distributive Heyting algebras are [[Boolean algebra]]s, and the exponential object has the explicit form <math>\neg P \lor Q</math>, thus making it clear that the exponential object really is [[Material implication (rule of inference)|material implication]].<ref>{{Cite book |last1=Mac Lane |first1=Saunders |url= |title=Sheaves in Geometry and Logic: A First Introduction to Topos Theory |last2=Moerdijk |first2=Ieke |date=1992 |publisher=Springer-Verlag, part of Springer Science & Business Media |isbn=978-0-387-97710-2 |publication-place=New York |pages=48–57 |language=en |chapter=Chapter I. Categories of Functors; sections 7. Propositional Calculus, 8. Heyting Algebras, and 9. Quantifiers as Adjoints |chapter-url=https://books.google.com/books?id=SGwwDerbEowC&pg=PA48}}</ref>

=== Category theory ===
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 (category theory)|adjunction]] in [[cartesian closed category|cartesian closed categories]]. That is, there is a [[Natural transformation|natural]] [[isomorphism]] between the [[morphism (category theory)|morphisms]] from a [[product (category theory)|binary product]] <math>f \colon (X \times Y) \to Z </math> and the morphisms to an exponential object <math>g \colon X \to Z^Y </math>.

This generalizes to a broader result in [[closed monoidal category|closed monoidal categories]]: Currying is the statement that the [[monoidal category|tensor product]] and the [[internal Hom]] are [[adjoint functors]]; that is, for every object <math>B</math> there is a [[natural transformation|natural isomorphism]]:

:<math> \mathrm{Hom}(A\otimes B, C) \cong \mathrm{Hom}(A, B\Rightarrow C) .</math>

Here, ''Hom'' denotes the (external) Hom-functor of all morphisms in the category, while <math>B\Rightarrow C</math> 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 <math>B\Rightarrow C</math> becomes the exponential object <math>C^B</math>.

Currying can break down in one of two ways. One is if a category is not [[closed category|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 category|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]].<ref>{{Cite conference |last1=Abramsky |first1=Samson |last2=Coecke |first2=Bob |date=5 March 2007 |contribution=A categorical semantics of quantum protocols |doi=10.1109/LICS.2004.1319636 |title= Logic in Computer Science (LICS 2004): Proceedings, 19th Annual IEEE Symposium, Turku, Finland, 2004] |pages=415–425 |language=en |publisher=IEEE Computer Society Press |arxiv=quant-ph/0402130|isbn=978-0-7695-2192-3 }}</ref>

The difference between these two is that the [[product (mathematics)|product]] for cartesian categories (such as the [[category of sets]], [[complete partial order]]s or [[Heyting algebra]]s) 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 [[type system|types]] in the [[type theory]] of [[LISP]], [[scheme (programming language)|Scheme]] and many [[functional programming language]]s.

By contrast, the product for [[monoidal category|monoidal categories]] (such as [[Hilbert space]] and the [[vector space]]s 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 [[cobordism]]s in [[algebraic topology]], and to [[string theory]].<ref name="rosetta">{{Cite book |last1=Baez |first1=John C. |last2=Stay |first2=Mike |title=New Structures for Physics |chapter=Physics, Topology, Logic and Computation: A Rosetta Stone |date=6 June 2009 |editor-last=Coecke |editor-first=Bob |url=https://math.ucr.edu/home/baez/rosetta/rose3.pdf |series=Lecture Notes in Physics |publisher=Springer |publication-place=Berlin, Heidelberg |publication-date=5 July 2010 |volume=813: New Structures for Physics |pages=95–172 |arxiv=0903.0340 |doi=10.1007/978-3-642-12821-9_2 |isbn=978-3-642-12821-9 |s2cid=115169297 |archive-url=https://web.archive.org/web/20221205124044/https://math.ucr.edu/home/baez/rosetta/rose3.pdf |archive-date=5 December 2022}}</ref> The [[linear type system]], and [[linear logic]] are useful for describing [[synchronization primitive]]s, such as mutual exclusion locks, and the operation of vending machines.

== Contrast with partial function application ==
{{main article|Partial application}}
Currying and partial function application are often conflated.<ref name="lambda-the-ultimate" /><ref name="uncarved">{{cite web |date=7 August 2020 |title=Partial Function Application is not Currying |url=https://www.uncarved.com/articles/not-currying/ |url-status=live |archive-url=https://web.archive.org/web/20161023205431/http://www.uncarved.com/articles/not_currying |archive-date=23 October 2016 |work=The Uncarved Block}}</ref> 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.<ref>{{cite web |last=Lee |first=G. Kay |date=15 May 2013 |title=Functional Programming in 5 Minutes |url=http://slid.es/gsklee/functional-programming-in-5-minutes |work=Slides}}</ref>

Given a function of type <math>f \colon (X \times Y \times Z) \to N </math>, currying produces <math>\text{curry}(f) \colon X \to (Y \to (Z \to N)) </math>. That is, while an evaluation of the first function might be represented as <math>f(1, 2, 3)</math>, evaluation of the curried function would be represented as <math>f_\text{curried}(1)(2)(3)</math>, applying each argument in turn to a single-argument function returned by the previous invocation. Note that after calling <math>f_\text{curried}(1)</math>, 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 <math>f</math> above, we might fix (or 'bind') the first argument, producing a function of type <math>\text{partial}(f) \colon (Y \times Z) \to N</math>. Evaluation of this function might be represented as <math>f_\text{partial}(2, 3)</math>. 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 [[parameter (computer science)|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'') =&nbsp;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 <code>plus_one</code>. 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 <math>f \colon (X \times Y \times Z) \to N </math> and <math>a \in X</math> then <math>\text{curry}(\text{partial}(f)_a)(y)(z) = \text{curry}(f)(a)(y)(z) </math> or simply <math>\text{partial}(f)_a = \text{curry}_1(f)(a) </math> where <math>\text{curry}_1</math> 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 <math>f(x,y)</math>, a function <math>g(y,x)</math> may be defined such that <math>g(y,x) = f(x,y)</math>. 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.

== See also ==
* [[Tensor-hom adjunction]]
* [[Lazy evaluation]]
* [[Closure (computer science)]]
* [[smn theorem|''{{subsup|S|n|m}}'' theorem]]
* [[Closed monoidal category]]

== References ==
{{Reflist}}

== External links ==
{{Wiktionary|currying}}

{{Haskell Curry}}
{{Design patterns}}

[[Category:Higher-order functions]]
[[Category:Functional programming]]
[[Category:Lambda calculus]]
<!-- Hidden categories below -->
[[Category:Articles with example Java code]]