Lambda calculus

formal system in mathematical logic

function definition that is not bound to an identifier

logical formalism using combinators instead of variables

mathematical function that takes one or more functions as an input or that outputs a function

In mathematics and computer science, currying is the technique of translating a function that takes multiple arguments into a sequence of families of functions, each taking a single argument.

typed lambda calculus

theorem that, when applying reduction rules to terms in some variants of the lambda calculus, the ordering in which the reductions are chosen does not make a difference to the eventual result

typed formalism that uses the lambda-symbol (λ) to denote anonymous function abstraction

Type of category in category theory

representation of the natural numbers as higher-order functions

approach to natural language semantics

higher-order function y for which y f = f (y f)

formal system in mathematical logic

a framework

formal system

potential state for a term in Lambda calculus

type system supporting type inference

an object that cannot be rewritten further

technique used in functional programming