 The resulting type after the proof is complete is the type of the whole expression.Thus, proving that some sequence of words is a sentence of some language amounts to proving that the words reduce to the type "S".The syntactic type of a lexical item can be either a primitive type, such as "S", "N", or "NP", or complex, such as "S\NP", or "NP/N".