Lesson plan
Partial application
In computer science, partial application (or partial function application) refers to the process of fixing a number of arguments of a function, producing another function of smaller arity. Given a function f \colon (X \times Y \times Z) \to N , we might fix (or 'bind') the first argument, producing a function of type \text{partial}(f) \colon (Y \times Z) \to N . Evaluation of this function might be represented as f_\text{partial}(2, 3) . Note that the result of partial function application in this case is a function that takes two arguments. Partial application is sometimes incorrectly called currying, which is a related, but distinct concept.
Article summary
In computer science, partial application (or partial function application) refers to the process of fixing a number of arguments of a function, producing another function of smaller arity. Given a function f \colon (X \times Y \times Z) \to N , we might fix (or 'bind') the first argument, producing a function of type \text{partial}(f) \colon (Y \times Z) \to N . Evaluation of this function might be represented as f_\text{partial}(2, 3) . Note that the result of partial function application in this case is a function that takes two arguments. Partial application is sometimes incorrectly called currying, which is a related, but distinct concept.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.