Additionally, the strong normalization property described below implies that any evaluation strategy will terminate on all simply typed terms.

The presentation given above is not the only way of defining the syntax of the simply typed lambda calculus.

Both of these types can be defined as simple extensions of the simply typed lambda calculus.

She had typed simply, I cannot live without you.

NBE was first described for the simply typed lambda calculus.

A categorial grammar shares some features with the simply typed lambda calculus.

For instance, they do not exist in simply typed lambda calculus.

He also doesn't like being typed simply as a scorer.

For instance, the simply typed lambda calculus corresponds to the internal language of cartesian closed categories.

Simply typed lambda-calculus with type operators, λ, is obtained by imposing only this property.