Everything About ___
Live briefing

Everything about Partial application

In functional programming

In computer science, partial application refers to the process of fixing a number of arguments of a function, producing another function of smaller arity. Given a function, we might fix the first argument, producing a function of type. Evaluation of this function might be represented as. 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. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Partial applicationA 5-minute orientation
  2. Skim a recent paper: Application of new Kudryashov method to various nonlinear partial differential equationsInfluential work since 2022
  3. Pick up a classic book: Representation and control of infinite dimensional systemsThe most-reprinted book on the subject
  4. Read the landmark paper: Partial Least Squares Structural Equation Modeling: Rigorous Applications, Better Results and Higher AcceptanceCited 4,000 times
  5. Go sideways: Conservative vector fieldA closely related topic
  6. Go sideways: Jet (mathematics)A closely related topic

📖 Definitions

Noun The process of fixing a number of arguments to a function, producing another function of smaller arity.

🗂️ The subject at a glance

  1. Motivation
  2. Implementations
  3. Definitions
  4. Mathematical formulation and examples

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics