  We propose a concrete surface representation of abstract categorial grammars
in the category of word cobordisms or cowordisms for short, which are certain
bipartite graphs decorated with words in a given alphabet, generalizing linear
logic proof-nets. We also introduce and study linear logic grammars, directly
based on cobordisms and using classical multiplicative linear logic as a typing
system.

Logic in Computer Science;Computation and Language