Simply Typed Lambda Calculus - General Observations

General Observations

Given the standard semantics, the simply typed lambda calculus is strongly normalizing: that is, well-typed terms always reduce to a value, i.e., a abstraction. This is because recursion is not allowed by the typing rules: it is impossible to find types for fixed-point combinators and the looping term . Recursion can be added to the language by either having a special operator of type or adding general recursive types, though both eliminate strong normalization.

Since it is strongly normalizing, it is decidable whether or not a simply typed lambda calculus program halts: it does! We can therefore conclude that the language is not Turing complete.

Read more about this topic:  Simply Typed Lambda Calculus

Famous quotes containing the words general and/or observations:

    “I never saw any people who appeared to live so much without amusement as the Cincinnatians.... Were it not for the churches,... I think there might be a general bonfire of best bonnets, for I never could discover any other use for them.”
    —Frances Trollope (1780–1863)

    “Science is a dynamic undertaking directed to lowering the degree of the empiricism involved in solving problems; or, if you prefer, science is a process of fabricating a web of interconnected concepts and conceptual schemes arising from experiments and observations and fruitful of further experiments and observations.”
    —James Conant (1893–1978)