 The CCG formalism defines a number of combinators (application, composition, and type-raising being the most common).These operate on syntactically-typed lexical items, by means of Natural deduction style proofs.The goal of the proof is to find some way of applying the combinators to a sequence of lexical items until no lexical item is unused in the proof.