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.