Recent work in categorial grammar has seen proposals for a wide range of systems, differing in their `resource sensitivity'...

. In the framework of labelled proof nets the task of parsing in categorial grammar can be reduced to the problem of first-order matching under theory. Here we shall show how to use the same method of labelled proof nets to reduce the task of generating to the problem of higher-order matching. 1 Introduction Categorial grammar provides a mechanism for the analysis of linguistic expressions on the basis of lexicalism and the parsing as deduction paradigm ([17]). 3 In accordance with lexicalism each lexical entry of the language encapsulates all the information needed to analyse the lexical item, and the grammar itself only needs to know how to manage these resources. In the particular case of categorial grammar, a lexical categorisation is a formula, or type, constructed over some basic types by logical connectives; and the grammar constitutes the connectives' syntactic behaviour (i.e. the laws governing the connectives). Within the parsing as deduction paradigm the problem of analys...

This paper expounds the notion of sorted multimodal categorial logic, and makes two generalisations of categorial calculus of discontinuity. In the first, we introduce unary modalities which mediate between continuous and discontinuous strings. In the second, the modes of adjunction of the classical discontinuity calculus, concatenation, juxtaposition and interpolation, are augmented with variants...