Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01060070n
Noun Concept
Categories: Computability theory, Formal methods, Theoretical computer science, Articles with short description, Articles with example Lisp code
EN
lambda calculus  Β Reduction  A conversion  abstraction operator  Alpha-conversion
EN
Lambda calculus is a formal system in mathematical logic for expressing computation based on function abstraction and application using variable binding and substitution. Wikipedia
Definitions
Relations
Sources
EN
Lambda calculus is a formal system in mathematical logic for expressing computation based on function abstraction and application using variable binding and substitution. Wikipedia
A formulation of the theory of reflexive functions that has deep connections to computational theory Wikipedia Disambiguation
Formal system in mathematical logic Wikidata
Any of a family of functionally complete algebraic systems in which lambda expressions are evaluated according to a fixed set of rules to produce values, which may themselves be lambda expressions. Wiktionary
Algebraic system. Wiktionary (translation)
IS A
mathematical model
formal system
PART OF
theory of computation
HAS KIND
binary lambda calculus
typed lambda calculus
HAS INSTANCE
simply typed lambda calculus
System F
DISCOVERER OR INVENTOR
Alonzo Church
HAS QUALITY
Turing completeness
NAMED AFTER
lambda
USE
model of computation
Wikipedia
EN
lambda calculus
Wikidata
EN
lambda calculus
Wiktionary
EN
lambda calculus
Wikipedia Redirections
EN
A conversion, abstraction operator, Alpha-conversion, alpha-renaming, Alpha conversion, alpha equivalence, Alpha equivalent, Alpha reduction, Alpha renaming, AlphaRenaming, anonymous function abstraction, B-reduction, Beta-reduction, beta conversion, beta reduction, Beta substitution, capture-avoiding substitution, Eta-conversion, Eta-reduction, Eta conversion, eta expansion, Eta reduction, functional abstraction, L-calculus, L calculus, lambda-calculi, lambda-calculus, Lambda-definable function, lambda-definable functions, Lambda-recursive function, Lambda-term bound variables, lambda abstraction, Lambda calculas, lambda calculi, Lambda Calculus, Lambda kalkül, Lambda language, Lambda programming, lambda term, lambda terms, Lamda calculus, Lamda expression, Lanbda-calculus, substitution (lambda calculus), Type-free lambda calculus, Type free lambda calculus, Typefree lambda calculus, untyped lambda calculus, α-conversion, Α conversion, β-reduction, Β Reduction, Β reduction, Η-conversion, Η conversion, Λ-abstraction, λ-calculus, λ calculus, Λa-calculus, λx, λy, λz
Wikidata Alias
EN
lambda calculi, type-free lambda calculus, untyped lambda calculus, λ-calculi, λ-calculus

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License