In computer science, partial application (or partial function application) refers to the process of fixing a number of arguments to a function, producing another function of smaller arity. Given a function
Contents
Motivation
Intuitively, partial function application says "if you fix the first arguments 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.
Implementations
In languages such as ML and Haskell functions are defined in curried form by default. Supplying fewer than the total number of arguments is referred to as partial application.
In languages with first-class functions one can define curry, uncurry and papply to perform currying and partial application explicitly. This might incur a greater run-time overhead due to the creation of additional closures, while Haskell can use more efficient techniques.
Scala implements optional partial application with placeholder, e.g. def add(x: Int, y: Int) = {x+y}; add(1, _: Int) returns an incrementing function. Scala also support multiple parameter lists as currying, e.g. def add(x: Int)(y: Int) = {x+y}; add(1) _
Clojure implements partial application using the partial function defined in its core library.
The C++ standard library provides bind(function, args..) to return a function object that is the result of partial application of the given arguments to the given function.
Definitions
In the simply-typed lambda calculus with function and product types (λ→,×) partial application, currying and uncurrying can be defined as:
papply : (((a × b) → c) × a) → (b → c) = λ(f, x). λy. f (x, y)curry : ((a × b) → c) → (a → (b → c)) = λf. λx. λy. f (x, y)uncurry : (a → (b → c)) → ((a × b) → c) = λf. λ(x, y). f x yNote that curry papply = curry.