List of Tables -- 1 Introduction1 -- 2 Order as constituent constructor -- 1 Combinatory syntactic types -- 2 Directionality in grammar: morphology, phonology or syntax? -- 3 Trees and algorithms -- 4 CCG's narrow claims in brief -- 5 Type-dependence versus structure-dependence -- 6 Constituency -- 3 The lexicon, argumenthood and combinators -- 1 Adjacency and arity -- 2 Words, supercombinators and subcombinators -- 3 Infinitude and learnability-in-principle -- 4 Syntacticizing the combinators -- 1 Unary combinators -- 2 Binary combinators -- 3 Ternary combinators -- 4 Quaternary combinators -- 5 Powers and combinations -- 6 Why syntacticize? -- 5 Combinatory Categorial Grammar -- 1 Combinators and wrapping -- 2 Linguistic categories -- 3 CCG is nearly context-free -- 4 Invariants of natural language combination -- 5 The BTS system -- 6 The LF debate -- 1 Steedman's LF -- 2 Szabolcsi's reflexives -- 3 Jacobson's pronouns -- 4 More on LF: Unary BCWZ, constituency and coordination -- 7 Further constraints on possible grammars -- 8 A BTSO system -- 9 The semantic radar -- 1 Boundedness and unboundedness -- 2 Recursive thoughts and recursive expressions -- 3 Grammar, lexicon and the interfaces -- 4 Making CCG's way through the Dutch impersonal passive -- 5 Computationalism and language acquisition -- 6 Stumbling on to knowledge of words -- 7 Functional categories -- 8 Case, agreement and expletives -- 9 The semantics of scrambling -- 10 Searle and semantics -- 10 Monadic computation by CCG -- 1 Application -- 2 Dependency -- 3 Sequencers -- 4 The CCG monad -- 5 Radical lexicalization revisited -- 6 Monadic results and CCG -- 11 Conclusion -- Appendices -- Appendix A: Lambda calculus -- Appendix B: Combinators -- Appendix C: Variable elimination -- Appendix D: Theory of computing.

Appendix E: Radical lexicalization and syntactic types -- Appendix F: Dependency structures -- Notes -- Bibliography -- Author and name index -- Subject index.