Difference between revisions of "Lambda calculus"
Jump to navigation
Jump to search
(added needed page for lambda calculus) |
(+cat) |
||
| 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 [[Paradox|paradoxes]]. | 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|paradoxes]]. | ||
| + | |||
| + | [[Category:Calculus]] | ||
Revision as of 21:15, January 14, 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.