Difference between revisions of "Lambda Calculus"
From Wiki Notes @ WuJiewen.com, by Jiewen Wu
(New page: Lambda calculus, or λ-calculus, is a formal system for function definition, function application and recursion.) |
|||
| (5 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
| − | Lambda calculus, or λ-calculus, is a formal system for function definition, function application and recursion. | + | Lambda calculus, or λ-calculus, is a formal system for function definition, function application and recursion. |
| + | |||
| + | In general, there are a number of different models of computation: Turing machine, Cellular automata and λ-calculus. TM is the most popular model as far as I am concerned, which was inspired by paper and pencil. Imperative languages like the pervasive C/C++, Java, etc. follow from this model. λ-calculus, proposed by Church, was inspired by mathematical functions, and has its representative languages like ML, Scheme, Lisp, etc. The last one, inspired by life forms, observes how living cells interact with neighbors, and has no popular language derived. | ||
| + | |||
| + | |||
| + | |||
| + | [[Category:Theoretic Foundations]] | ||
Latest revision as of 11:30, 14 January 2009
Lambda calculus, or λ-calculus, is a formal system for function definition, function application and recursion.
In general, there are a number of different models of computation: Turing machine, Cellular automata and λ-calculus. TM is the most popular model as far as I am concerned, which was inspired by paper and pencil. Imperative languages like the pervasive C/C++, Java, etc. follow from this model. λ-calculus, proposed by Church, was inspired by mathematical functions, and has its representative languages like ML, Scheme, Lisp, etc. The last one, inspired by life forms, observes how living cells interact with neighbors, and has no popular language derived.
