A
typed lambda calculus is a typed
formalism that uses the lambda-symbol (
![](http://info.babylon.com/onlinebox.cgi?rt=GetFile&uri=!!ARV6FUJ2JP&type=0&index=2761)
) to denote anonymous function abstraction. In this context, types are usually objects of a syntactic nature that are assigned to lambda terms; the exact nature of a type depends on the calculus considered (see kinds below). From a certain point of view, typed lambda calculi can be seen as refinements of the
untyped lambda calculus but from another point of view, they can also be considered the more fundamental theory and
untyped lambda calculus a special case with only one type.