Difference between revisions of "Lambda calculus"
Jump to navigation
Jump to search
(added needed page for lambda calculus) |
|||
| (One intermediate revision by one other user not shown) | |||
| Line 1: | Line 1: | ||
| − | Lambda calculus is a type-theory where formulae have an ordinal-valued type. Formulae are built up using Lambda λ abstraction and application. Lambda calculus is used by computer programmers to avoid [[ | + | '''Lambda calculus''' is a type-theory where formulae have an ordinal-valued type. Formulae are built up using Lambda λ abstraction and application. Lambda calculus is used by computer programmers to avoid [[paradox]]es. |
| + | |||
| + | [[Category:Calculus]] | ||
Latest revision as of 01:57, May 4, 2008
Lambda calculus is a type-theory where formulae have an ordinal-valued type. Formulae are built up using Lambda λ abstraction and application. Lambda calculus is used by computer programmers to avoid paradoxes.