LAMBDACALCULUS

Lambda calculus

Lambda calculus is a formal system in mathematical logic and computer science for expressing computation based on function abstraction and application using variable binding and substitution. First formulated by Alonzo Church to formalize the concept of effective computability, lambda calculus found early successes in the area of computability theory, such as a negative answer to Hilbert's Entscheidungsproblem. Lambda calculus is a conceptually simple universal model of computation . The name derives from the Greek letter lambda used to denote binding a variable in a function.

The above text is a snippet from Wikipedia: Lambda calculus
and as such is available under the Creative Commons Attribution/Share-Alike License.

lambda calculus

Noun

  1. 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.


The above text is a snippet from Wiktionary: lambda calculus
and as such is available under the Creative Commons Attribution/Share-Alike License.

Need help with a clue?
Try your search in the crossword dictionary!