The linear parsing algorithm for pregroup grammars presented here exploits regularities of types in the dictionary. Sufficient conditions on the dictionary are given for the algorithm to be complete. Its working is illustrated by a grammar which handles distant agreement of features in French, including modal verbs, clitics, the compound past and the passive mode. The grammar has a semantic interpretation into predicate logic which captures the unbounded dependences.