Karl Jones: Created page with "In mathematics and computer science, '''currying''' is the technique of translating the evaluation of a function that takes multiple Parameter (computer programming)..."

2016-05-16T21:36:33Z

Created page with "In mathematics and computer science, '''currying''' is the technique of translating the evaluation of a function that takes multiple Parameter (computer programming)..."

New page

In [[mathematics]] and [[computer science]], '''currying''' is the technique of translating the evaluation of a function that takes multiple [[Parameter (computer programming)|arguments]] (or a tuple of arguments) into evaluating a sequence of [[functions]], each with a single argument.

== Description ==

It was introduced by [[Gottlob Frege]], developed by [[Moses Schönfinkel]], and further developed by [[Haskell Curry]].

== Uncurrying ==

'''Uncurrying''' is the dual transformation to currying, and can be seen as a form of defunctionalization.

It takes a function f(x) that returns another function g(y) as a result, and yields a new function f ′(x, y) that takes a number of additional parameters and applies them to the function returned by function f.

The process can be iterated.

== See also ==

* [[Closed monoidal category]]
* [[Closure (computer science)]]
* [[Function (mathematics)]]
* [[Lazy evaluation]]
* [[smn theorem|s<sub>mn</sub> theorem]]
* [[Tensor-hom adjunction]]

== External links ==

* [https://en.wikipedia.org/wiki/Currying Currying] @ Wikipedia

[[Category:Mathematics]]
[[Category:Higher-order functions]]
[[Category:Functional programming]]
[[Category:Lambda calculus]]

Currying - Revision history

Karl Jones: Created page with "In mathematics and computer science, '''currying''' is the technique of translating the evaluation of a function that takes multiple Parameter (computer programming)..."