lambda calculus

E26971

Lambda calculus is a formal system in mathematical logic and computer science that uses function abstraction and application to investigate computation and serves as a foundational model for programming languages.


Statements (49)
Predicate Object
instanceOf formal system
model of computation
theoretical framework
equivalentTo Turing machine in computational power
field mathematical logic
theoretical computer science
formalizedIn lambda notation
foundationFor functional programming languages
theory of programming languages
hasApplication automated theorem proving
compiler design
program verification
hasConcept Church–Rosser property
alpha conversion
beta reduction
bound variable
combinator
confluence
eta conversion
free variable
lambda abstraction
normal form
strong normalization
weak normalization
hasEncoding Church encoding
Curry encoding
Scott encoding
hasProperty Turing completeness
hasVariant dependent type lambda calculus
polymorphic lambda calculus
simply typed lambda calculus
untyped lambda calculus
influenced F#
Haskell
LISP
LambdaProlog
ML
OCaml
Scheme
introducedBy Alonzo Church
introducedInYear 1930s
relatedTo combinatory logic
represents computable functions
studies computation
usedIn denotational semantics
proof theory
type theory
uses function abstraction
function application


Please wait…