Lambda calculus
Lambda calculus (also written as λ-calculus) is a formal system in mathematical logic for expressing computation based on function abstraction and application using variable binding and substitution. It is a universal 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.
Lambda calculus - Wikipedia Jump to content From Wikipedia, the free encyclopedia Mathematical-logic system based on functions The lambda abstraction decomposed. The λ {\displaystyle \lambda } indicates the start of a function. x {\displaystyle x} is the input parameter. M {\displaystyle M} is the body, separated by a dot separator " . {\displaystyle .} " from the input parameter. In mathematical logic , the lambda calculus (also written as λ -calculus ) is a formal system for expressing computation based on function abstraction and application using variable binding and substitution .
Explore this link on the map →saved by
related reading
- Palmström: The Lambda Calculus for Absolute Dummies (like myself)palmstroem.blogspot.com
- Overview ‹ λ-2D: An Exploration of Drawing as Programming Language, Featuring Ideas from Lambda Calculus - MIT Media Labmedia.mit.edu
- Memoization - Wikipediaen.wikipedia.org
- ho.history overview - Why did Alonzo Church choose the letter $\lambda$ as the "binding operator"? - MathOverflowmathoverflow.net
- I never understood this obsession with lambda calculus or ycombinator. If most o... | Hacker Newsnews.ycombinator.com
- Y: The Most Beautiful Idea in Computer Science explained in JavaScriptlucasfcosta.com
- First-order logic - Wikipediaen.wikipedia.org
- Alligator Eggs!worrydream.com
- CSC 151 - Anonymous procedureseikmeier.sites.grinnell.edu
- Structure and Interpretation of Computer Programsmitp-content-server.mit.edu
- The Church-Turing Thesis (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- Lambda lifting - Wikipediaen.wikipedia.org