理解部分应用Partially Application

• Partial Application

  Partial Applicaiton (or partial function application) refers to the process of fixing a number of arguments to a function, producing another function of smaller arity.

  Partial application is sometimes incorrectly called currying, which is a related, but distinct concept.

• arity

  Arity is the number of arguments or operands taken by a function or operation in logic, mathematics, and computer science.

  In mathematics, arity may also be named rank.

  For example, the arity of the addition operation is 2, or addition is an operation of arity 2.

• Curring

  In mathmatics and computer science, curring is the technique of converting a function that takes multiple arguments into a sequence of functions that each take a single argument.

• References

1. PEP 309 – Partial Function Application
2. Functional Programming: Currying vs. Partial Application