Derivational versus lexical semantics.  The constraints imposed by resource-sensitivity put severe limitations on the expressivity of the derivational semantics. To some extent, these can be overcome at the level of lexical semantics. The Curry-Howard term associated with a derivation, seen as a program for meaning assembly, abstracts from the contribution of particular lexical items.  The semantic specification for a lexical item of type A takes the form of a lambda term of the corresponding semantic type A′, but this lambda term is no longer required to be linear.  Below some examples of non-linear lexical meaning recipes.  The specification for the reflexive pronoun ‘himself’ is a pure combinator (a closed term): it identifies the first and second argument of a binary relation.  The terms for the relative pronoun ‘that’ or for the determiners ‘a, some’ have an abstraction that binds two occurrences of a variable, so as to compute the intersection of their two (e → t) arguments (noun and verb phrase), and to test the intersection for non-emptiness in the case of ‘some’.