blanketglossary

Lambda calculus

Definition

In mathematical logic, the lambda calculus is a formal system for expressing computation based on function abstraction and application using variable binding and substitution. Untyped lambda calculus, the topic of this article, is a universal machine, i.e. a model of computation that can be used to simulate any Turing machine. It was introduced by the mathematician Alonzo Church in the 1930s as part of his research into the foundations of mathematics. In 1936, Church found a formulation which was logically consistent, and documented it in 1940.

Related concepts

A. C. Croom ALGOL 60 Abstract logic Abstraction (computer science)Ackermann set theory Alan Turing Aleph number Alfred Foster (mathematician)Algebraic function Algebraic logic Alice ter Meulen Alonzo Church Alonzo Church (college president)Alphabet (formal languages)Alternative semantics Ambiguity American Journal of Mathematics Analytic function Anaphora (linguistics)Anonymous function Antecedent-contained deletion Applicative computing systems Argument Arithmetic Arity Atomic formula Atomic model (mathematical logic)Atomic sentence Automata theory Automated theorem proving Autonomy of syntax Axiom Axiom of choice Axiom schema Axiomatic system Axiomatization of Boolean algebras B, C, K, W system Backus–Naur form Banach–Tarski paradox Benjamin C. Pierce Beta normal form Big O notation Bijection Binary lambda calculus Binary operation Binary relation Binding (linguistics)Boolean-valued function Boolean algebra Boolean algebras canonically defined Boolean function C++11 C++ Templates C. Anthony Anderson C Sharp (programming language)Calculus of constructions Caml Cantor's diagonal argument Cantor's paradox Cantor's theorem Cardinality Cartesian closed category Cartesian product Cataphora Categorial grammar Categorical abstract machine Categorical theory Category (mathematics)Category of sets Category theory Church encoding Church numeral Church–Rosser theorem Church–Turing thesis Class (set theory)Classical logic Clojure Codomain Coercion (linguistics)Cognitive semantics Combinator calculus Combinatory categorial grammar Combinatory logic Communications of the ACM Compactness theorem Complement (set theory)Complete theory Complex-valued function Computability Computability theory Computable function Computable set Computably enumerable set Computational complexity theory Computational semantics Computer science Concrete category Conditional sentence Confluence (abstract rewriting)Cons Conservative extension Conservativity Consistency Constant function Constructible universe Construction of the real numbers Constructive set theory Context set Continuation Continuous function Continuum hypothesis Conversational scoreboard Countable set Counterfactuals Crossover effects Cumulativity (linguistics)Currying Curry–Howard isomorphism Dana Scott De Bruijn index De Bruijn notation De dicto and de re De se Decidability (logic)Decision problem Deductive system Definiteness Denotation Denotational semantics Deontic modality Diagram (mathematical logic)Director string Discourse relation Discourse representation theory Disjunction Distributed computing Distributional semantics Domain of a function Domain theory Donkey anaphora Downward entailing Dynamic semantics Eeny, meeny, miny, moe Eiffel (programming language)Element (mathematics)Elementary diagram Elementary equivalence Elementary function arithmetic Empty set Encyclopedia of Mathematics Enumeration Epistemic modality Epsilon operator Equiconsistency Equivalence relation Esoteric programming language Euclid's Elements Euclidean geometry European Mathematical Society Evaluation strategy Evidentiality Execution (computing)Exhaustivity Existential closure Existential quantification Explicit substitution Expression (mathematics)Extension (semantics)Extension by definitions Extension by new constant and function names Extensionality Factorial Faultless disagreement Finitary relation Finite-valued logic Finite model theory Finite set First-class function First-class object First-order logic Fixed-point combinator Fixed-point logic Focus (linguistics)Forcing (mathematics)Formal grammar Formal language Formal proof Formal semantics (logic)Formal semantics (natural language)Formal system Formalism (mathematics)Formation rule Foundations of geometry Foundations of mathematics Free On-line Dictionary of Computing Free choice inference Free logic Free variables and bound variables Frege–Church ontology Fresh variable Function (computer programming)Function (mathematics)Function application Function composition Function of a complex variable Function of a real variable Function of several complex variables Function of several real variables Function pointer Function space Functional predicate Functional programming Functor Futures and promises Fuzzy set Gary R. Mar General set theory Generalized quantifier Generative grammar George Alfred Barnard Givenness Glue semantics Graph reduction Grothendieck universe Ground expression Ground formula Gödel's completeness theorem Gödel's incompleteness theorems Gödel numbering Hacker (programmer subculture)Halting problem Harrop formula Hartley Rogers, Jr Henk Barendregt Hereditary set Heriot-Watt University Higher-order function Higher-order logic Hilbert's axioms Hilbert system History of logic History of mathematical logic History of the function concept Homogeneity (linguistics)Hurford disjunction Identity function Image (mathematics)Imperative programming Implicit function Inaccessible cardinal Inalienable possession Independence (mathematical logic)Indexicality Inductive definition Inference Inferentialism Infinite-valued logic Infinite set Information theory Inhabited set Injective function Input/output Inquisitive semantics Integer-valued function Intension Intensional logic Interaction nets Internal language Internet Encyclopedia of Philosophy Interpretation (logic)Interpretation (model theory)Interpretation function Intersection (set theory)Intersective modifier Inverse function Iota operator Isomorphism J. B. Rosser J. Barkley Rosser JavaScript John C. Mitchell John George Kemeny Kappa calculus Kleene–Rosser paradox Knights of the Lambda Calculus Kolmogorov complexity Kripke's theory of truth Kripke–Platek set theory Krivine machine Lambda Lambda-mu calculus Lambda calculus definition Lambda cube Large cardinal Laws of exponents Lemma (mathematics)Leon Henkin Let expression Lexical semantics Library (computing)Lindström's theorem Linear map Linguistic entailment Linguistics Linguistics wars Linked list List of Hilbert systems List of axioms List of first-order theories List of formal systems List of mathematical functions List of mathematical theories List of set identities and relations List of statements independent of ZFC Logic Logic translation Logical biconditional Logical conjunction Logical connective Logical consequence Logical constant Logical disjunction Logical equality Logical equivalence Logical form (linguistics)Logical truth Logicism Logophoricity Low-level programming language Löwenheim–Skolem theorem MIT Press Many-valued logic Map (mathematics)Maplet Martin Davis (mathematician)Material conditional Mathematical logic Mathematical object Mathematical proof Mathematics Maurice L'Abbé Meaning postulate Measurable function Mereology Metalanguage Michael O. Rabin Minimal axioms for Boolean algebra Minimalism (computing)Mirativity Modal subordination Modality (semantics)Model complete theory Model of computation Model theory Mogensen–Scott encoding Monad (functional programming)Monadic predicate calculus Monadic second-order logic Montague grammar Morphism Morse–Kelley set theory Multivalued function NLab NP (complexity)Naive set theory Name binding Name collision Natural deduction Natural number Negation New Foundations Nicholas Rescher Non-Euclidean geometry Non-logical symbol Non-standard model Non-standard model of arithmetic Nondeterministic algorithm Normalization property (abstract rewriting)Norman Shapiro North-Holland Publishing Company Object (computer science)Opaque context Open formula Operation (mathematics)Ordered pair Ordinal analysis Ordinal number Orrin Frink P (complexity)P versus NP problem Paradoxes of set theory Parallel computing Parameter (computer programming)Partial function Partially ordered sets Partition of a set Pascal (programming language)Peano axioms Performative utterance Peter B. Andrews Peter Landin Philosophy Philosophy of language Philosophy of mathematics Plural quantification Polarity item Polynomial Portable Document Format Possible world Power set Pragmatics Predicate (mathematical logic)Predicate logic Predicate variable Presupposition Prime model Primitive recursive arithmetic Primitive recursive function Princeton University Principia Mathematica Principle of compositionality Privative adjective Procedural programming Process calculi Programming idiom Programming language Programming language theory Proof of impossibility Proof theory Proposition Propositional attitudes Propositional calculus Propositional formula Propositional variable Pure type system Python (programming language)Quantificational variability effect Quantifier (logic)Quantifier raising Quantifier rank Quantization (linguistics)Question under discussion Rational function Raymond Smullyan Real-valued function Recursion Recursive set Reduction strategy Reduction strategy (lambda calculus)Reference Relation (mathematics)Responsive predicate Restriction (mathematics)Reverse mathematics Rewrite system Rewriting Richard Montague Rising declarative Robinson arithmetic Rule of inference Russell's paradox Ruy de Queiroz SECD machine SKI combinator calculus Satisfiability Saturated model Scala (programming language)Scalar implicature Scheme (programming language)Schröder–Bernstein theorem Scope (formal semantics)Scott continuity Scott–Curry theorem Second-order arithmetic Second-order logic Segmented discourse representation theory Self-reference Self-verifying theories Semantic parsing Semantic theory of truth Semantics Semantics (computer science)Semantics (logic)Semantics of logic Sentence (mathematical logic)Sequence Sequent calculus Set-valued function Set (mathematics)Set theory Signature (logic)Simon B. Kochen Simply typed lambda calculus Singleton (mathematics)Singleton set Situation semantics Skolem arithmetic Sloppy identity Smalltalk Smooth function Soundness Spectrum of a sentence Spectrum of a theory Speech act Square of opposition Squiggle operator Stack overflow Stephen Cole Kleene Stephen Kleene Strawson entailment Strength (mathematical logic)Strict conditional Strict programming language String (formal languages)Strongly normalising Structure (mathematical logic)Structure and Interpretation of Computer Programs Studia Logica Subsective modifier Substitution (algebra)Substitution (logic)Substructure (mathematics)Subtrigging Subtyping Supertask Supervaluationism Surjective function Syllogism Symbol (formal)Syntactic sugar Syntax (logic)Syntax–semantics interface System F T-schema Tail call optimization Tarski's axiomatization of the reals Tarski's axioms Tarski's theory of truth Tarski's undefinability theorem Tarski–Grothendieck set theory Tautology (logic)Telicity Temperature paradox Tense–aspect–mood Term (logic)Term logic The MIT Press Theorem Theories of truth Theory (mathematical logic)Thierry Coquand Three-valued logic Timeline of mathematical logic To Mock a Mockingbird Transfer principle Transitive set True arithmetic Truth-conditional semantics Truth predicate Truth table Truth value Tuple Turing complete Turing completeness Turing machine Type (model theory)Type shifter Type system Type theory Type theory with records Typed lambda calculi Typed lambda calculus Ultrafilter (set theory)Ultraproduct Uncountable set Undecidable problem Uninterpreted function Union (set theory)Uniqueness quantification Universal Turing machine Universal grinder Universal machine Universal quantification Universal set Universe (mathematics)University of California, Los Angeles Unlambda Urelement Vagueness Validity (logic)Variable (mathematics)Venn diagram Veridicality Virtual machine Von Neumann universe Von Neumann–Bernays–Gödel set theory Weakly normalising Well-formed formula William Bigelow Easton William Boone (mathematician)William W. Tait Wolfram Language Z combinator Zermelo–Fraenkel set theory

153 concepts already in your glossary