lambdacalculusbased
lambdacalculusbased is an adjective used to describe systems, languages, or research approaches that take the lambda calculus as their primary formal basis for computation. The lambda calculus, developed in the 1930s by Alonzo Church, expresses computation through function abstraction and application. Its minimal syntax consists of variables, abstractions (λx.M), and applications (M N). Computation proceeds by beta reduction, substituting arguments for bound variables. The untyped version is Turing complete, while typed variants—such as simply typed, polymorphic (System F), or dependently typed calculi—impose restrictions to ensure properties like safety and termination.
A lambda-calculus-based framework emphasizes core notions of function construction, substitution, and reduction, supporting higher-order functions and
Applications of lambda-calculus-based approaches include the design and semantics of functional programming languages, formal verification, compiler
Note: the term is sometimes hyphenated as lambda-calculus-based. In practice it describes a wide range of frameworks