Applicative computing systems - Applicative computing systems, or ACS are the systems of object calculi founded on combinatory logic and lambda calculus.

B, C, K, W system - The B, C, K, W system is a variant of combinatory logic that takes as primitive the combinators B, C, K, and W. This system was discovered by Haskell Curry in his doctoral thesis Grundlagen der kombinatorischen Logik, whose results are set out in Curry.

Categorical abstract machine - The categorical abstract machine is a model of computation for programs that preserves the abilities of applicative, functional, or compositional style. It is based on the techniques of applicative computing.

Combinatory categorial grammar - Combinatory categorial grammar is an efficiently parsable, yet linguistically expressive grammar formalism. It has a transparent interface between surface syntax and underlying semantic representation, including predicate-argument structure, quantification and information structure.

Explicit substitution - In computer science, lambda calculi are said to have explicit substitutions if they pay special attention to the formalization of the process of substitution.

Graph reduction machine - A graph reduction machine is a special-purpose computer built to perform combinator calculations by graph reduction.