A type‑driven grammatical framework in which words are assigned categories that denote functions or atomic types (e.g., S, NP, (S\NP)/NP), and syntactic composition proceeds by function–argument application and a small set of combinatory rules; categories directly determine how expressions combine and permit a transparent mapping to compositional semantics.

Principle

Syntactic combination corresponds to function application of type‑defined categories: if a lexical item has a functional category expecting an argument of type A to produce B, then it composes with an expression of type A to yield type B; derivations are driven by category calculus rather than by phrase‑structure rewrite rules.

Demonstration

Illustrative scenario → Situation: A transitive verb is lexically assigned category (S\NP)/NP. Recognition: Identify an NP object and an NP subject in a sentence. Action: The verb first applies to the object NP ((S\NP)/NP + NP → S\NP), then the resulting constituent applies to the subject NP (S\NP + NP → S). Consequence: The derivation yields both syntactic well‑formedness and a compositional semantic representation without separate transformational steps.

Misapplication

Equating categorial categories with simple word‑class labels (e.g., calling any verb category just 'V') or ignoring directionality and argument structure encoded in category formulas. The error is to treat categories as labels rather than as type specifications that determine allowed compositions.

Consequence

Categorial analyses produce a tight syntax–semantics interface and enable direct compositional derivations; they influence type‑logically informed parsing strategies and semantic composition methods in formal semantics and computational systems.

Reversal

When phenomena require extensive type‑raising, multi‑step combinators or additional mechanics (e.g., for long‑distance dependencies), the simple function–argument view must be extended by richer combinatory rules or type‑logical machinery, complicating the original simplicity.

Boundary

Clearly within: lexicalized, type‑driven analyses where category formulas specify argument structure and directionality. Boundary case: constructions requiring non‑local composition that can be modeled either by extended categorial combinators or by separate movement/trace devices. Clearly outside: grammar frameworks that do not treat combinatory type calculus as the primary generative mechanism.

Semantic Tension

Tension between strictly lexicalized, type‑driven composition and frameworks that distribute grammatical generalizations across phrasal rewrite rules or transformational operations; categorial grammars favor local type composition over global rule application.

Synthesis

Categorial Grammar reduces syntactic assembly to algebraic operations on types: by encoding argument structure in lexical categories, it yields a direct route from surface combination to compositional meaning.