Linked from

The 23 pages that link to Lambda calculus, each with the reason it gives.

• Turing machineCompared with: It defines computability differently yet matches Turing machines in computational power.

• FunctionRelated: It gives functions a precise role in the foundations of computation.

• Alan TuringCompared with: Church’s independent model of computation reached results parallel to Turing’s.

• Type theoryRelated: Lambda calculus supplies a core language for many type theories.

• Halting problemCompared with: It offers a different model in which undecidable termination questions also arise.

• SemanticsRelated: It represents the functions that combine meanings in compositional semantic analyses.

• Alonzo ChurchBroader topic: Church developed it as a foundation for defining functions and formalizing computation.

• Computer scienceRelated: It offers a foundational model of computation closely connected to programming languages.

• EntscheidungsproblemRelated: Church’s proof used lambda calculus to formalize effective calculability and establish undecidability.

• Computable functionRelated: Its evaluation rules provide another formal account of computable functions.

• Free variableNarrower topic: Its lambda abstractions provide another setting where free and bound occurrences matter.

• Universal Turing machineCompared with: It is a distinct formal model equivalent in computational power to Turing machines.

• Bound variableRelated: Lambda abstraction uses the same scope-based notion of variable binding.

• Functional programmingNarrower topic: Its function-centered model underlies much of functional language design.

• Undecidable problemRelated: Church used this calculus to formalize effective computation and prove undecidability.

• Combinatory logicCompared with: It provides the variable-based notation that combinatory logic can eliminate.

• Church–Rosser theoremNarrower topic: The theorem is a central property of its untyped version.

• HaskellNarrower topic: Haskell’s functions and evaluation rules draw on the computational model of lambda calculus.

• Theoretical computer scienceRelated: Its equivalence to Turing machines connects programming languages to computability.

• Barbara H. ParteeRelated: Lambda abstraction lets semantic representations compose when syntactic structures combine.

• Cartesian closed categoryRelated: Cartesian closed categories interpret lambda abstraction and application through exponentials and evaluation.

• Model of computationBroader topic: It represents computation through function evaluation rather than machine instructions.

• Turing's proofCompared with: Church’s lambda-calculus proof reaches the same undecidability conclusion without Turing machines.