Apply
In mathematics and computer science, apply is a function that applies a function to arguments. It is central to programming languages derived from lambda calculus, such as LISP and Scheme, and also in functional languages. It has a role in the study of the denotational semantics of computer programs, because it is a continuous function on complete partial orders. Apply is also a continuous function in homotopy theory, and, indeed underpins the entire theory: it allows a homotopy deformation to be viewed as a continuous path in the space of functions. Likewise, valid mutations (refactorings) of computer programs can be seen as those that are "continuous" in the Scott topology.

The most general setting for apply is in category theory, where it is right adjoint to currying in closed monoidal categories. A special case of this are the Cartesian closed categories, whose internal language is simply typed lambda calculus.
Q395
mathematics
Concept
Q21198
computer science
Concept
Q5508767
applies
Concept
Q9143
programming language
Concept
Q242028
lambda calculus
Concept
Q132874
LISP
Concept
Q187560
Scheme
Concept
Q193076
functional language
Concept
Q1189746
denotational semantics
Concept
Q895815
continuous function
Concept
Q3082805
complete partial order
UNK
Q9357062
homotopy theory
Concept
Q895815
Scott topology
Concept
Q217413
category theory
Concept
Q357858
right adjoint
Concept
Q1144925
currying
Concept
Q5135347
closed monoidal categories
Concept
Q1725874
Cartesian closed categories
Concept
Q18376327
internal language
Concept
Q855192
simply typed lambda calculus
Concept
Q4781618
Apply
Concept
studies
programming paradigm
instance of
programming paradigm
studies