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:

    “A poet’s object is not to tell what actually happened but what could or would happen either probably or inevitably.... For this reason poetry is something more scientific and serious than history, because poetry tends to give general truths while history gives particular facts.”
    —Aristotle (384–323 B.C.)

    “I have never yet seen any plan which has not been mended by the observations of those who were much inferior in understanding to the person who took the lead in the business.”
    —Edmund Burke (1729–1797)