We can therefore conclude that the language is not Turing complete .
Since it is strongly normalising , it is decidable whether or not a simply typed lambda calculus program halts : in fact , it always halts .
We can conclude that the language is not Turing complete .
Since it is strongly normalising , it is decidable whether or not a simply typed lambda calculus program halts : in fact , it always halts .